Move TreeNode to util packagep

Author: nlohia-godaddy

Diff for: src/main/java/leetcode/AverageOfLevelsInBinaryTree.java

@@ -1,5 +1,7 @@
 package leetcode;
 
+import util.TreeNode;
+
 import java.util.ArrayList;
 import java.util.LinkedList;
 import java.util.List;

Diff for: src/main/java/leetcode/BinaryTreeInOrderTraversal.java

@@ -1,5 +1,7 @@
 package leetcode;
 
+import util.TreeNode;
+
 import java.util.ArrayList;
 import java.util.List;
 import java.util.Stack;

Diff for: src/main/java/leetcode/BinaryTreeRightSIdeView.java

@@ -1,5 +1,7 @@
 package leetcode;
 
+import util.TreeNode;
+
 import java.util.ArrayList;
 import java.util.LinkedList;
 import java.util.List;

Diff for: src/main/java/leetcode/ConstructStringFromBinaryTree.java

@@ -1,5 +1,7 @@
 package leetcode;
 
+import util.TreeNode;
+
 /**
  * Created by nikoo28 on 12/17/17 3:01 AM
  */

Diff for: src/main/java/leetcode/ConvertSortedArrayToBinarySearchTree.java

@@ -1,5 +1,7 @@
 package leetcode;
 
+import util.TreeNode;
+
 /**
  * Created by nikoo28 on 9/23/18 12:57 PM
  */

Diff for: src/main/java/leetcode/DiameterOfBinaryTree.java

@@ -1,5 +1,7 @@
 package leetcode;
 
+import util.TreeNode;
+
 /**
  * Created by nikoo28 on 9/23/18 11:07 PM
  */

Diff for: src/main/java/leetcode/InvertBinaryTree.java

@@ -1,5 +1,7 @@
 package leetcode;
 
+import util.TreeNode;
+
 import java.util.Deque;
 import java.util.LinkedList;
 

Diff for: src/main/java/leetcode/LeafSimilar.java

@@ -1,5 +1,7 @@
 package leetcode;
 
+import util.TreeNode;
+
 import java.util.ArrayList;
 import java.util.List;
 

Diff for: src/main/java/leetcode/MaximumDepthOfABinaryTree.java

@@ -1,5 +1,7 @@
 package leetcode;
 
+import util.TreeNode;
+
 import java.util.LinkedList;
 import java.util.Queue;
 

Diff for: src/main/java/leetcode/SumOfLeftLeaves.java

@@ -1,5 +1,7 @@
 package leetcode;
 
+import util.TreeNode;
+
 /**
  * Created by nikoo28 on 12/17/17 3:24 PM
  */

Diff for: src/main/java/leetcode/TreeNode.java

@@ -1,5 +1,7 @@
 package leetcode;
 
+import util.TreeNode;
+
 /**
  * @author nikoo28 on 9/16/17
  */

Diff for: src/main/java/leetcode/TrimABinarySearchTree.java

@@ -1,5 +1,7 @@
 package leetcode;
 
+import util.TreeNode;
+
 import java.util.ArrayList;
 import java.util.List;
 

Diff for: src/main/java/leetcode/TwoSumIV.java

@@ -2,7 +2,7 @@
 
 import java.util.*;
 
-import leetcode.TreeNode;
+import util.TreeNode;
 
 /**
  * @author nikoo28 on 9/17/17

Diff for: src/main/java/leetcode/easy/ConvertBstToGreaterTree.java

@@ -1,6 +1,6 @@
 package leetcode.easy;
 
-import leetcode.TreeNode;
+import util.TreeNode;
 
 import java.util.HashMap;
 import java.util.Map;

Diff for: src/main/java/leetcode/easy/DiameterOfABinaryTree.java

@@ -1,6 +1,6 @@
 package leetcode.easy;
 
-import leetcode.TreeNode;
+import util.TreeNode;
 /**
  * Created by nikoo28 on 12/19/17 12:58 AM
  */

Diff for: src/main/java/leetcode/easy/LowestCommonAncestorOfBinarySearchTree.java

@@ -1,6 +1,6 @@
 package leetcode.easy;
 
-import leetcode.TreeNode;
+import util.TreeNode;
 
 /**
  * @author nikoo28 on 9/10/17

Diff for: src/main/java/leetcode/easy/MergeTwoBinaryTrees.java

@@ -1,6 +1,6 @@
 package leetcode.easy;
 
-import leetcode.TreeNode;
+import util.TreeNode;
 
 import java.util.LinkedList;
 import java.util.Queue;

Diff for: src/main/java/leetcode/easy/SymmetricTree.java

@@ -1,6 +1,6 @@
 package leetcode.hard;
 
-import leetcode.TreeNode;
+import util.TreeNode;
 
 /**
  * Created by nikoo28 on 7/12/19 3:06 AM

Diff for: src/main/java/leetcode/hard/SerializeAndDeserializeABinaryTree.java

@@ -4,7 +4,7 @@
 import java.util.List;
 import java.util.Queue;
 
-import leetcode.TreeNode;
+import util.TreeNode;
 
 /**
  * Created by nikoo28 on 12/19/17 1:01 AM

Diff for: src/main/java/leetcode/medium/BinaryTreeLevelOrderTraversal.java

@@ -2,7 +2,7 @@
 
 import java.util.*;
 
-import leetcode.TreeNode;
+import util.TreeNode;
 
 /**
  * Created by nikoo28 on 2019-08-24 18:30

Diff for: src/main/java/leetcode/medium/BinaryTreeZigzagLevelOrderTraversal.java

@@ -1,6 +1,6 @@
 package leetcode.medium;
 
-import leetcode.TreeNode;
+import util.TreeNode;
 
 /**
  * Created by nikoo28 on 12/19/17 12:55 AM

Diff for: src/main/java/leetcode/medium/LowestCommonAncestorOfBinaryTree.java

@@ -1,6 +1,6 @@
 package leetcode.medium;
 
-import leetcode.TreeNode;
+import util.TreeNode;
 
 import java.util.LinkedList;
 import java.util.Queue;

Diff for: src/main/java/leetcode/medium/MaximumLevelSumOfABinaryTree.java

@@ -0,0 +1,39 @@
+package util;
+
+/**
+ * Definition for a binary tree node.
+ */
+public class TreeNode {
+
+  public int val;
+  public TreeNode left;
+  public TreeNode right;
+
+  public TreeNode(int x) {
+    val = x;
+    left = null;
+    right = null;
+  }
+
+  public static void main(String[] args) {
+
+    TreeNode root = new TreeNode(4);
+
+    root.left = new TreeNode(8);
+    root.right = new TreeNode(15);
+
+    TreeNode leftNode = root.left;
+    TreeNode rightNode = root.right;
+
+    leftNode.left = new TreeNode(16);
+
+    rightNode.left = new TreeNode(23);
+    rightNode.right = new TreeNode(42);
+
+    // Will print 4
+    System.out.println(root.val);
+
+    // Will print 23
+    System.out.println(root.right.left.val);
+  }
+}

Diff for: src/main/java/util/TreeNode.java

@@ -1,6 +1,6 @@
 package leetcode.easy;
 
-import leetcode.TreeNode;
+import util.TreeNode;
 import org.junit.jupiter.api.Test;
 
 import static org.junit.jupiter.api.Assertions.*;

Diff for: src/test/java/leetcode/easy/DiameterOfABinaryTreeTest.java

@@ -1,6 +1,6 @@
 package leetcode.easy;
 
-import leetcode.TreeNode;
+import util.TreeNode;
 import org.junit.jupiter.api.Test;
 
 import static org.junit.jupiter.api.Assertions.*;

Diff for: src/test/java/leetcode/easy/SymmetricTreeTest.java

@@ -1,6 +1,6 @@
 package leetcode.hard;
 
-import leetcode.TreeNode;
+import util.TreeNode;
 import org.junit.jupiter.api.Test;
 
 import static org.junit.jupiter.api.Assertions.*;

Diff for: src/test/java/leetcode/hard/SerializeAndDeserializeABinaryTreeTest.java

@@ -1,6 +1,6 @@
 package leetcode.medium;
 
-import leetcode.TreeNode;
+import util.TreeNode;
 import org.junit.jupiter.api.Test;
 
 import static org.junit.jupiter.api.Assertions.*;