update

Author: surikunal

march_2021/week_2/addOneRowToTree.java

@@ -0,0 +1,53 @@
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
+ * }
+ */
+class Solution {
+    public TreeNode addOneRow(TreeNode root, int v, int d) {
+        if (d == 1) {
+            TreeNode base = new TreeNode(v);
+            base.left = root;
+            return base;
+        }
+        
+        Queue<TreeNode> queue = new LinkedList<>();
+        queue.add(root);
+        int depth = 1;
+        while (depth < d - 1) {
+            Queue<TreeNode> temp = new LinkedList<>();
+            while (!queue.isEmpty()) {
+                TreeNode node = queue.remove();
+                if (node.left != null)
+                    temp.add(node.left);
+                if (node.right != null)
+                    temp.add(node.right);
+            }
+            queue = temp;
+            depth++;
+        }
+        
+        while (!queue.isEmpty()) {
+            TreeNode node = queue.remove();
+            TreeNode temp = node.left;
+            node.left = new TreeNode(v);
+            node.left.left = temp;
+            temp = node.right;
+            node.right = new TreeNode(v);
+            node.right.right = temp;
+        }
+        return root;
+    }
+}public class addOneRowToTree {
+    
+}