Add files via upload

Author: shatakshigarg

BINARY TREE 1/HEIGHT OF TREE.txt

@@ -0,0 +1,22 @@
+public class Solution {
+
+	public static int height(BinaryTreeNode<Integer> root) {
+		//Your code goes here
+        if (root==null)
+        {
+            return 0;
+        }
+        
+        int smallLeftOutput=height(root.left);
+        int smallRightOutput=height(root.right);
+        if (smallLeftOutput>smallRightOutput)
+        {
+            return smallLeftOutput+1;
+        }
+        else
+        {
+            return smallRightOutput+1;
+        }
+	}
+
+}

BINARY TREE 1/IS NODE PRESENT.txt

@@ -0,0 +1,20 @@
+public class Solution {
+
+	public static boolean isNodePresent(BinaryTreeNode<Integer> root, int x) {
+	    //Your code goes here
+        if (root==null)
+        {
+            return false;
+        }
+        
+        if (root.data==x)
+        {
+            return true;
+        }
+        else
+        {
+            return (isNodePresent(root.left,x)||isNodePresent(root.right,x));
+        }
+	}
+
+}

BINARY TREE 1/NODES GREATER THEN X.txt

@@ -0,0 +1,21 @@
+public class Solution {
+
+	public static int countNodesGreaterThanX(BinaryTreeNode<Integer> root, int x) {
+		//Your code goes here
+        if (root==null)
+        {
+            return 0;
+        }
+        
+        int smallOutput=countNodesGreaterThanX(root.left,x)+countNodesGreaterThanX(root.right,x);
+        if (root.data>x)
+        {
+            return smallOutput+1;
+        }
+        else
+        {
+            return smallOutput;
+        }
+	}
+
+}

BINARY TREE 1/POSTORDER BINARY TREE.txt

@@ -0,0 +1,14 @@
+public class Solution {
+
+	public static void postOrder(BinaryTreeNode<Integer> root) {
+		//Your code goes here
+        if (root==null)
+        {
+            return;
+        }
+        postOrder(root.left);
+        postOrder(root.right);
+        System.out.print(root.data+" ");
+	}
+
+}

BINARY TREE 1/PREORDER BINARY TREE.txt

@@ -0,0 +1,14 @@
+public class Solution {
+
+	public static void preOrder(BinaryTreeNode<Integer> root) {
+		//Your code goes here
+        if (root==null)
+        {
+            return;
+        }
+        System.out.print(root.data+" ");
+        preOrder(root.left);
+        preOrder(root.right);
+	}
+
+}

BINARY TREE 1/REPLACENODE WITH DEPTH.txt

@@ -0,0 +1,19 @@
+public class Solution {
+
+	public static void changeToDepthTree(BinaryTreeNode<Integer> root) {
+	    //Your code goes here
+        changeToDepthTree(root,0);
+	}
+    
+    public static void changeToDepthTree(BinaryTreeNode<Integer> root, int depth)
+    {
+        if (root==null)
+        {
+            return;
+        }
+        root.data=depth;
+        changeToDepthTree(root.left,depth+1);
+        changeToDepthTree(root.right,depth+1);
+    }
+
+}

BINARY TREE 1/SUM OF NODES.txt

@@ -0,0 +1,13 @@
+public class Solution {
+
+	public static int getSum(BinaryTreeNode<Integer> root) {
+		//Your code goes here.
+        if (root==null)
+        {
+            return 0;
+        }
+        int smallSum=getSum(root.left)+getSum(root.right);
+        return root.data+smallSum;
+	}
+
+}