Commit6dcce9f

committed

Modified Data Structures/Trees folder .java file name and class name

1 parentdcf7f8f commit6dcce9fCopy full SHA for 6dcce9f

File tree

+10

-10

lines changed

+10

-10

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-publicclassAVLtree {`
	`1`	`+publicclassAVLTree {`
`2`	`2`
`3`	`3`	`privateNoderoot;`
`4`	`4`
`@@ -200,7 +200,7 @@ private void reheight(Node node){`
`200`	`200`	`}`
`201`	`201`
`202`	`202`	`publicstaticvoidmain(String[]args) {`
`203`		`-AVLtreetree =newAVLtree();`
	`203`	`+AVLTreetree =newAVLTree();`
`204`	`204`
`205`	`205`	`System.out.println("Inserting values 1 to 10");`
`206`	`206`	`for (inti =1;i <10;i++)`

Lines changed: 3 additions & 3 deletions

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`		`-classBinaryTree`
	`12`	`+publicclassLevelOrderTraversal`
`13`	`13`	`{`
`14`	`14`	`// Root of the Binary Tree`
`15`	`15`	`Noderoot;`
`16`	`16`
`17`		`-publicBinaryTree()`
	`17`	`+publicLevelOrderTraversal()`
`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`	`publicstaticvoidmain(Stringargs[])`
`67`	`67`	`{`
`68`		`-BinaryTreetree =newBinaryTree();`
	`68`	`+LevelOrderTraversaltree =newLevelOrderTraversal();`
`69`	`69`	`tree.root=newNode(1);`
`70`	`70`	`tree.root.left=newNode(2);`
`71`	`71`	`tree.root.right=newNode(3);`

Lines changed: 2 additions & 2 deletions

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`		`-classBinaryTree {`
	`17`	`+publicclassLevelOrderTraversalQueue {`
`18`	`18`
`19`	`19`	`Noderoot;`
`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`		`-BinaryTreetree_level =newBinaryTree();`
	`52`	`+LevelOrderTraversalQueuetree_level =newLevelOrderTraversalQueue();`
`53`	`53`	`tree_level.root =newNode(1);`
`54`	`54`	`tree_level.root.left =newNode(2);`
`55`	`55`	`tree_level.root.right =newNode(3);`

Lines changed: 1 addition & 1 deletion

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`		`-publicclassMain`
	`81`	`+publicclassPrintTopViewofTree`
`82`	`82`	`{`
`83`	`83`	`publicstaticvoidmain(String[]args)`
`84`	`84`	`{`

Lines changed: 2 additions & 2 deletions

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`		`-publicclassBinaryTree`
	`13`	`+publicclassValidBSTOrNot`
`14`	`14`	`{`
`15`	`15`	`//Root of the Binary Tree`
`16`	`16`	`Noderoot;`
`@@ -47,7 +47,7 @@ boolean isBSTUtil(Node node, int min, int max)`
`47`	`47`	`/* Driver program to test above functions */`
`48`	`48`	`publicstaticvoidmain(Stringargs[])`
`49`	`49`	`{`
`50`		`-BinaryTreetree =newBinaryTree();`
	`50`	`+ValidBSTOrNottree =newValidBSTOrNot();`
`51`	`51`	`tree.root =newNode(4);`
`52`	`52`	`tree.root.left =newNode(2);`
`53`	`53`	`tree.root.right =newNode(5);`

Comments

(0)