Runtime: 29 ms (Top 75.56%) | Memory: 52.2 MB (Top 77.99%)

Author: AnasImloul

scripts/algorithms/F/Find Elements in a Contaminated Binary Tree/Find Elements in a Contaminated Binary Tree.java

@@ -1,11 +1,12 @@
+// Runtime: 29 ms (Top 75.56%) | Memory: 52.2 MB (Top 77.99%)
 class FindElements {
     TreeNode tree,nodept;
     public FindElements(TreeNode root) {
         tree=root;
         tree.val=0;
         go(tree);
     }
-    
+
     void go(TreeNode node){
         if(node.left!=null){
             node.left.val=node.val*2+1;
@@ -16,11 +17,11 @@ void go(TreeNode node){
             go(node.right);
         }
     }
-    
+
     public boolean find(int target) {
         return doit(target);
     }
-    
+
     boolean doit(int target){
         if(target==0){
             nodept=tree;
@@ -35,4 +36,4 @@ else if(nodept.right!=null && nodept.right.val==target)
         else f=false;
         return f;
     }
-}
+}