Added 7 tree solutions

varunu28 · varunu28 · commit 78e0108fd756 · 2018-09-25T17:04:50.000-07:00
diff --git a/GeeksForGeeks/Practice/DS/BinarySearchTree/ChildrenSumParent.java b/GeeksForGeeks/Practice/DS/BinarySearchTree/ChildrenSumParent.java
@@ -0,0 +1,32 @@
+class ChildrenSumParent {
+    public static int sum(Node root){
+        if(root==null) {
+            return 0;
+        }
+        
+        if(root.left==null && root.right==null) {
+            return root.data;
+        }
+        
+        return sum(root.left)+sum(root.right);
+    }
+
+    public static int isSumProperty(Node node) {
+        if(node==null) {
+            return 1;
+        }
+        
+        if(node.left==null && node.right==null) {
+            return 1;
+        }
+        
+        int s=sum(node.left)+sum(node.right);
+        
+        if(s==node.data) {
+            return Math.min(isSumProperty(node.left), isSumProperty(node.right));
+        }
+        else {
+            return 0;
+        }
+    }
+}
diff --git a/GeeksForGeeks/Practice/DS/BinarySearchTree/CountNonLeafNodesInTree.java b/GeeksForGeeks/Practice/DS/BinarySearchTree/CountNonLeafNodesInTree.java
@@ -0,0 +1,13 @@
+class CountNonLeafNodesInTree {
+	int countNonLeafNodes(Node node) {
+	    if (node == null) {
+	        return 0;
+	    }
+	    
+	    if (node.left == null && node.right == null) {
+	        return 0;
+	    }
+	    
+	    return 1 + countNonLeafNodes(node.left) + countNonLeafNodes(node.right);
+	}
+}
diff --git a/GeeksForGeeks/Practice/DS/BinarySearchTree/Inorder Traversal.java b/GeeksForGeeks/Practice/DS/BinarySearchTree/Inorder Traversal.java
@@ -0,0 +1,21 @@
+/* A Binary Tree node
+class Node {
+    int data;
+    Node left, right;
+   Node(int item)    {
+        data = item;
+        left = right = null;
+    }
+} */
+class GfG {
+    void inOrder(Node root)
+    {
+       if (root == null) {
+           return;
+       }
+       
+       inOrder(root.left);
+       System.out.print(root.data + " ");
+       inOrder(root.right);
+    }
+}
diff --git a/GeeksForGeeks/Practice/DS/BinarySearchTree/LevelOfNodeInBinaryTree.java b/GeeksForGeeks/Practice/DS/BinarySearchTree/LevelOfNodeInBinaryTree.java
@@ -0,0 +1,31 @@
+class LevelOfNodeInBinaryTree {
+    public static int getLevel(Node root, int key) {
+        int level = 1;
+        Queue<Node> queue = new LinkedList<>();
+        
+        queue.add(root);
+        
+        while (!queue.isEmpty()) {
+            int size = queue.size();
+            
+            while (size-- > 0) {
+                Node temp = queue.remove();
+                if (temp.data == key) {
+                    return level;
+                }
+                
+                if (temp.left != null) {
+                    queue.add(temp.left);
+                }
+                
+                if (temp.right != null) {
+                    queue.add(temp.right);
+                }
+            }
+            
+            level++;
+        }
+        
+        return -1;
+    }
+}
diff --git a/GeeksForGeeks/Practice/DS/BinarySearchTree/MaxMinBinaryTree.java b/GeeksForGeeks/Practice/DS/BinarySearchTree/MaxMinBinaryTree.java
@@ -0,0 +1,16 @@
+class MaxMinBinaryTree {
+	public static int findMax(Node root) {
+	    if (root == null) {
+	        return Integer.MIN_VALUE;
+	    }
+	    
+	    return Math.max(root.data, Math.max(findMax(root.left), findMax(root.right)));
+	}
+	public static int findMin(Node root) {
+	    if (root == null) {
+	        return Integer.MAX_VALUE;
+	    }
+	    
+	    return Math.min(root.data, Math.min(findMin(root.left), findMin(root.right)));
+	}
+}
diff --git a/GeeksForGeeks/Practice/DS/BinarySearchTree/SumOfLeftLeafNodes.java b/GeeksForGeeks/Practice/DS/BinarySearchTree/SumOfLeftLeafNodes.java
@@ -0,0 +1,20 @@
+class SumOfLeftLeafNodes {
+    public int sum = 0;
+    public int leftLeafSum(Node root) {
+      updateSum(root, false);
+      return sum;
+    }
+    
+    public void updateSum(Node node, boolean isLeft) {
+       if (node == null) {
+           return;
+       }
+       
+       if (node.left == null && node.right == null && isLeft) {
+           sum += node.data;
+       }
+       
+       updateSum(node.left, true);
+       updateSum(node.right, false);
+   }
+}
diff --git a/GeeksForGeeks/Practice/DS/BinarySearchTree/SumOfRightLeafNodes.java b/GeeksForGeeks/Practice/DS/BinarySearchTree/SumOfRightLeafNodes.java
@@ -0,0 +1,20 @@
+class SumOfRightLeafNodes {
+    public int sum = 0;
+    public int rightLeafSum(Node root) {
+      updateSum(root, false);
+      return sum;
+   }
+   
+   public void updateSum(Node node, boolean isRight) {
+       if (node == null) {
+           return;
+       }
+       
+       if (node.left == null && node.right == null && isRight) {
+           sum += node.data;
+       }
+       
+       updateSum(node.left, false);
+       updateSum(node.right, true);
+   }
+}
