Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update CHECK COUSINS.txt #1

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Update CHECK COUSINS.txt #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
155 changes: 65 additions & 90 deletions TEST 3/CHECK COUSINS.txt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,102 +1,77 @@
import java.util.ArrayList;


public class solution {

/* Binary Tree Node class
*
* class BinaryTreeNode<T> {
T data;
BinaryTreeNode<T> left;
BinaryTreeNode<T> right;
import java.util.ArrayList;

public BinaryTreeNode(T data) {
this.data = data;
}
}
*/
public class Solution {

/* Binary Tree Node class
*
* class BinaryTreeNode<T> {
* T data;
* BinaryTreeNode<T> left;
* BinaryTreeNode<T> right;
*
* public BinaryTreeNode(T data) {
* this.data = data;
* }
* }
*/

/*
Time Complexity - O(N)
Space Complexity - O(H)

where N is the number of nodes in the tree
and H is the height of the tree
*/



public static boolean areNodesSibling(BinaryTreeNode<Integer> root, int a, int b)
{
if (root == null)
{
return false;
}

if (root.left != null && root.right != null)
{
if (root.left.data == a && root.right.data == b)
{
return true;
}
if (root.left.data == b && root.right.data == a)
{
return true;
}
}

if (areNodesSibling(root.left, a, b))
{
return true;
}
if (areNodesSibling(root.right, a, b))
{
return true;
}

return false;
}

public static int findLevel(BinaryTreeNode<Integer> root, int x, int level)
{
if (root == null)
{
return 0;
}
if (root.data == x)
{
return level;
}

// if x is found in left subtree
int lev = findLevel(root.left, x, level + 1);
if (lev != 0)
{
return lev;
}

return findLevel(root.right, x, level + 1);
}

public static boolean isCousin(BinaryTreeNode<Integer> root, int p, int q)
{

*/

public static boolean areNodesSibling(BinaryTreeNode<Integer> root, int a, int b) {
if (root == null) {
return false;
}

if (root.left != null && root.right != null) {
if (root.left.data == a && root.right.data == b) {
return true;
}
if (root.left.data == b && root.right.data == a) {
return true;
}
}

if (areNodesSibling(root.left, a, b)) {
return true;
}
if (areNodesSibling(root.right, a, b)) {
return true;
}

return false;
}

public static int findLevel(BinaryTreeNode<Integer> root, int x, int level) {
if (root == null) {
return 0;
}
if (root.data == x) {
return level;
}

// if x is found in the left subtree
int lev = findLevel(root.left, x, level + 1);
if (lev != 0) {
return lev;
}

return findLevel(root.right, x, level + 1);
}

public static boolean isCousin(BinaryTreeNode<Integer> root, int p, int q) {
// a and b are the given two nodes
if (p != q && findLevel(root, p, 1) == findLevel(root, q, 1) && !areNodesSibling(root, p, q))
{
return true;
}
else
{
return false;
}
}
if (p != q && findLevel(root, p, 1) == findLevel(root, q, 1) && !areNodesSibling(root, p, q)) {
return true;
} else {
return false;
}
}

}


// public static boolean isCousin(BinaryTreeNode<Integer> root, int p, int q) {
// // Write your code here

// }