Merge pull request TheAlgorithms#360 from LeeChungWan/Trees

varunu28 · web-flow · commit d18033d05102 · 2017-12-16T05:54:17.000-08:00
Modified Data Structures/Trees folder .java file name and class name
diff --git a/Data Structures/Trees/AVLTree.java b/Data Structures/Trees/AVLTree.java
@@ -1,4 +1,4 @@
-public class AVLtree {
+public class AVLTree {
  
     private Node root;
  
@@ -200,7 +200,7 @@ private void reheight(Node node){
     }
  
     public static void main(String[] args) {
-        AVLtree tree = new AVLtree();
+        AVLTree tree = new AVLTree();
  
         System.out.println("Inserting values 1 to 10");
         for (int i = 1; i < 10; i++)
diff --git a/Data Structures/Trees/LevelOrderTraversal.java b/Data Structures/Trees/LevelOrderTraversal.java
@@ -9,12 +9,12 @@ public Node(int item)
     }
 }
  
-class BinaryTree
+public class LevelOrderTraversal
 {
     // Root of the Binary Tree
     Node root;
  
-    public BinaryTree()
+    public LevelOrderTraversal()
     {
         root = null;
     }
@@ -65,7 +65,7 @@ else if (level > 1)
     /* Driver program to test above functions */
     public static void main(String args[])
     {
-       BinaryTree tree = new BinaryTree();
+       LevelOrderTraversal tree = new LevelOrderTraversal();
        tree.root= new Node(1);
        tree.root.left= new Node(2);
        tree.root.right= new Node(3);
diff --git a/Data Structures/Trees/LevelOrderTraversalQueue.java b/Data Structures/Trees/LevelOrderTraversalQueue.java
@@ -14,7 +14,7 @@ public Node(int item) {
 }
  
 /* Class to print Level Order Traversal */
-class BinaryTree {
+public class LevelOrderTraversalQueue {
  
     Node root;
  
@@ -49,7 +49,7 @@ public static void main(String args[])
     {
         /* creating a binary tree and entering 
          the nodes */
-        BinaryTree tree_level = new BinaryTree();
+    	LevelOrderTraversalQueue tree_level = new LevelOrderTraversalQueue();
         tree_level.root = new Node(1);
         tree_level.root.left = new Node(2);
         tree_level.root.right = new Node(3);
diff --git a/Data Structures/Trees/PrintTopViewofTree.java b/Data Structures/Trees/PrintTopViewofTree.java
@@ -78,7 +78,7 @@ public void printTopView()
 }
  
 // Driver class to test above methods
-public class Main
+public class PrintTopViewofTree
 {
     public static void main(String[] args)
     {
diff --git a/Data Structures/Trees/ValidBSTOrNot.java b/Data Structures/Trees/ValidBSTOrNot.java
@@ -10,7 +10,7 @@ public Node(int item)
     }
 }
  
-public class BinaryTree
+public class ValidBSTOrNot
 {
     //Root of the Binary Tree
     Node root;
@@ -47,7 +47,7 @@ boolean isBSTUtil(Node node, int min, int max)
     /* Driver program to test above functions */
     public static void main(String args[])
     {
-        BinaryTree tree = new BinaryTree();
+        ValidBSTOrNot tree = new ValidBSTOrNot();
         tree.root = new Node(4);
         tree.root.left = new Node(2);
         tree.root.right = new Node(5);

Original file line number	Diff line number	Diff line change
`@@ -9,12 +9,12 @@ public Node(int item)`
`9`	`9`	`}`
`10`	`10`	`}`
`11`	`11`
`12`		`-class BinaryTree`
	`12`	`+public class LevelOrderTraversal`
`13`	`13`	`{`
`14`	`14`	`// Root of the Binary Tree`
`15`	`15`	`Node root;`
`16`	`16`
`17`		`- public BinaryTree()`
	`17`	`+ public LevelOrderTraversal()`
`18`	`18`	`{`
`19`	`19`	`root = null;`
`20`	`20`	`}`
`@@ -65,7 +65,7 @@ else if (level > 1)`
`65`	`65`	`/* Driver program to test above functions */`
`66`	`66`	`public static void main(String args[])`
`67`	`67`	`{`
`68`		`- BinaryTree tree = new BinaryTree();`
	`68`	`+ LevelOrderTraversal tree = new LevelOrderTraversal();`
`69`	`69`	`tree.root= new Node(1);`
`70`	`70`	`tree.root.left= new Node(2);`
`71`	`71`	`tree.root.right= new Node(3);`
Original file line number	Diff line number	Diff line change
`@@ -14,7 +14,7 @@ public Node(int item) {`
`14`	`14`	`}`
`15`	`15`
`16`	`16`	`/* Class to print Level Order Traversal */`
`17`		`-class BinaryTree {`
	`17`	`+public class LevelOrderTraversalQueue {`
`18`	`18`
`19`	`19`	`Node root;`
`20`	`20`
`@@ -49,7 +49,7 @@ public static void main(String args[])`
`49`	`49`	`{`
`50`	`50`	`/* creating a binary tree and entering`
`51`	`51`	`the nodes */`
`52`		`- BinaryTree tree_level = new BinaryTree();`
	`52`	`+ LevelOrderTraversalQueue tree_level = new LevelOrderTraversalQueue();`
`53`	`53`	`tree_level.root = new Node(1);`
`54`	`54`	`tree_level.root.left = new Node(2);`
`55`	`55`	`tree_level.root.right = new Node(3);`
Original file line number	Diff line number	Diff line change
`@@ -78,7 +78,7 @@ public void printTopView()`
`78`	`78`	`}`
`79`	`79`
`80`	`80`	`// Driver class to test above methods`
`81`		`-public class Main`
	`81`	`+public class PrintTopViewofTree`
`82`	`82`	`{`
`83`	`83`	`public static void main(String[] args)`
`84`	`84`	`{`
Original file line number	Diff line number	Diff line change
`@@ -10,7 +10,7 @@ public Node(int item)`
`10`	`10`	`}`
`11`	`11`	`}`
`12`	`12`
`13`		`-public class BinaryTree`
	`13`	`+public class ValidBSTOrNot`
`14`	`14`	`{`
`15`	`15`	`//Root of the Binary Tree`
`16`	`16`	`Node root;`
`@@ -47,7 +47,7 @@ boolean isBSTUtil(Node node, int min, int max)`
`47`	`47`	`/* Driver program to test above functions */`
`48`	`48`	`public static void main(String args[])`
`49`	`49`	`{`
`50`		`- BinaryTree tree = new BinaryTree();`
	`50`	`+ ValidBSTOrNot tree = new ValidBSTOrNot();`
`51`	`51`	`tree.root = new Node(4);`
`52`	`52`	`tree.root.left = new Node(2);`
`53`	`53`	`tree.root.right = new Node(5);`