Day 1 Challenge

Author: suriyakrishna

src/main/java/com/kishan/java/leetcode/juneChallenges/InvertTree.java

@@ -0,0 +1,65 @@
+package com.kishan.java.leetcode.juneChallenges;
+
+import com.kishan.java.leetcode.juneChallenges.TreeNode;
+
+public class InvertTree {
+
+    public static TreeNode invertTree(TreeNode treeNode) {
+        if (treeNode == null) {
+            return treeNode;
+        }
+        TreeNode tree = swapTree(treeNode);
+        tree.setLeft(invertTree(tree.getLeft()));
+        tree.setRight(invertTree(tree.getRight()));
+        return tree;
+    }
+
+    public static TreeNode swapTree(TreeNode tree) {
+        TreeNode temp = tree.getLeft();
+        TreeNode left = tree.getRight();
+        TreeNode right = temp;
+        tree.setRight(right);
+        tree.setLeft(left);
+        return tree;
+    }
+
+    public static void main(String[] args) {
+        TreeNode treeNode = new TreeNode(4, new TreeNode(2, new TreeNode(1), new TreeNode(3)), new TreeNode(7, new TreeNode(6), new TreeNode(9)));
+
+        System.out.println("Before Inverting");
+        System.out.println("root: " + treeNode.getValue());
+        System.out.println("root.left: " + treeNode.getLeft().getValue());
+        System.out.println("root.left.left: " + treeNode.getLeft().getLeft().getValue());
+        System.out.println("root.left.right: " + treeNode.getLeft().getRight().getValue());
+        System.out.println("root.right: " + treeNode.getRight().getValue());
+        System.out.println("root.right.left: " + treeNode.getRight().getLeft().getValue());
+        System.out.println("root.right.right: " + treeNode.getRight().getRight().getValue());
+
+        invertTree(treeNode);
+
+        System.out.println("\nAfter Inverting");
+        System.out.println("root: " + treeNode.getValue());
+        System.out.println("root.left: " + treeNode.getLeft().getValue());
+        System.out.println("root.left.left " + treeNode.getLeft().getLeft().getValue());
+        System.out.println("root.left.right " + treeNode.getLeft().getRight().getValue());
+        System.out.println("root.right " + treeNode.getRight().getValue());
+        System.out.println("root.right.left: " + treeNode.getRight().getLeft().getValue());
+        System.out.println("root.right.right: " + treeNode.getRight().getRight().getValue());
+
+
+        TreeNode swap = new TreeNode(4, new TreeNode(1), new TreeNode(3));
+
+        System.out.println("\nBefore Swapping");
+        System.out.println("root: " + swap.getValue());
+        System.out.println("left: " + swap.getLeft().getValue());
+        System.out.println("right: " + swap.getRight().getValue());
+
+        System.out.println("\nAfter Swapping");
+
+        swapTree(swap);
+        System.out.println("root: " + swap.getValue());
+        System.out.println("left: " + swap.getLeft().getValue());
+        System.out.println("right: " + swap.getRight().getValue());
+
+    }
+}

src/main/java/com/kishan/java/leetcode/juneChallenges/TreeNode.java

@@ -0,0 +1,52 @@
+package com.kishan.java.leetcode.juneChallenges;
+
+import sun.reflect.generics.tree.Tree;
+
+public class TreeNode {
+    private int value;
+    private TreeNode left;
+    private TreeNode right;
+
+    public TreeNode() {
+
+    }
+
+    public TreeNode(int value) {
+        this();
+        this.value = value;
+    }
+
+    public TreeNode(int value, TreeNode left) {
+        this(value);
+        this.left = left;
+    }
+
+    public TreeNode(int value, TreeNode left, TreeNode right) {
+        this(value, left);
+        this.right = right;
+    }
+
+    public int getValue() {
+        return value;
+    }
+
+    public void setValue(int value) {
+        this.value = value;
+    }
+
+    public void setLeft(TreeNode left) {
+        this.left = left;
+    }
+
+    public void setRight(TreeNode right) {
+        this.right = right;
+    }
+
+    public TreeNode getLeft() {
+        return left;
+    }
+
+    public TreeNode getRight() {
+        return right;
+    }
+}

src/main/scala/com/kishan/scala/leetcode/juneChallenges/TreeNode.scala

@@ -0,0 +1,8 @@
+package com.kishan.scala.leetcode.juneChallenges
+
+//Definition for a binary tree node.
+class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) {
+  var value: Int = _value
+  var left: TreeNode = _left
+  var right: TreeNode = _right
+}

src/main/scala/com/kishan/leetcode/juneChallenges/june1.scala renamed to src/main/scala/com/kishan/scala/leetcode/juneChallenges/invertTree.scala

@@ -1,4 +1,4 @@
-package com.kishan.leetcode.juneChallenges
+package com.kishan.scala.leetcode.juneChallenges
 
 // Problem Statement:
 
@@ -27,18 +27,10 @@ package com.kishan.leetcode.juneChallenges
 */
 
 
-//Definition for a binary tree node.
-class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) {
-  var value: Int = _value
-  var left: TreeNode = _left
-  var right: TreeNode = _right
-}
-
-object june1 {
-
+object invertTree {
 
   def invertTree(_tree: TreeNode): TreeNode = {
-    if(_tree == null){
+    if (_tree == null) {
       return _tree
     }
     var tree = swapTree(_tree)
@@ -81,7 +73,7 @@ object june1 {
     var level_1_Left = new TreeNode(2, new TreeNode(1), new TreeNode(3))
     var level_1_Right = new TreeNode(7, new TreeNode(6), new TreeNode(9))
     var root = new TreeNode(4, level_1_Left, level_1_Right)
-    //    var root = new TreeNode(2, new TreeNode(3, new TreeNode(1)))
+    //    var root = new com.kishan.leetcode.juneChallenges.TreeNode(2, new com.kishan.leetcode.juneChallenges.TreeNode(3, new com.kishan.leetcode.juneChallenges.TreeNode(1)))
     var root1 = new TreeNode(2, new TreeNode(1), new TreeNode(3))
     println("Before Inverting")
     printElementInTree(root)