Create Solution.java

Author: skully-coder

Binary Tree/Add One Row To Tree/Solution.java

@@ -0,0 +1,47 @@
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode(int x) { val = x; }
+ * }
+ */
+public class Solution {
+    class Node{
+        Node(TreeNode n,int d){
+            node=n;
+            depth=d;
+        }
+        TreeNode node;
+        int depth;
+    }
+    public TreeNode addOneRow(TreeNode t, int v, int d) {
+        if (d == 1) {
+            TreeNode n = new TreeNode(v);
+            n.left = t;
+            return n;
+        } 
+        Stack<Node> stack=new Stack<>();
+        stack.push(new Node(t,1));
+        while(!stack.isEmpty())
+        {
+            Node n=stack.pop();
+            if(n.node==null)
+                continue;
+            if (n.depth == d - 1 ) {
+                TreeNode temp = n.node.left;
+                n.node.left = new TreeNode(v);
+                n.node.left.left = temp;
+                temp = n.node.right;
+                n.node.right = new TreeNode(v);
+                n.node.right.right = temp;
+                
+            } else{
+                stack.push(new Node(n.node.left, n.depth + 1));
+                stack.push(new Node(n.node.right, n.depth + 1));
+            }
+        }
+        return t;
+    }
+}