Runtime: 88 ms (Top 52.38%) | Memory: 42.9 MB (Top 9.52%)

Author: AnasImloul

scripts/algorithms/B/Binary Tree Pruning/Binary Tree Pruning.js

@@ -1,9 +1,11 @@
+// Runtime: 88 ms (Top 52.38%) | Memory: 42.9 MB (Top 9.52%)
+
 /**
  * Definition for a binary tree node.
  * function TreeNode(val, left, right) {
- *     this.val = (val===undefined ? 0 : val)
- *     this.left = (left===undefined ? null : left)
- *     this.right = (right===undefined ? null : right)
+ * this.val = (val===undefined ? 0 : val)
+ * this.left = (left===undefined ? null : left)
+ * this.right = (right===undefined ? null : right)
  * }
  */
 /**
@@ -18,14 +20,14 @@ var pruneTree = function(root) {
         }
         node.left = rec(node.left);
         node.right = rec(node.right);
-		// For updated tree structure if threre are leaf nodes with zero value present, if yes then return null otherewise return node itself.
+        // For updated tree structure if threre are leaf nodes with zero value present, if yes then return null otherewise return node itself.
         if(node.val===0 && node.left == null && node.right == null){
             return null
         }
         return node;
     }
     rec (root);
     if(root.val == 0 && root.left == null && root.right == null) return null
-    
+
     return root;
-};
+};