algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-18 17:31:13 +08:00
Code Issues Packages Projects Releases Wiki Activity

removed duplciated data-structures

Browse Source
This commit is contained in:
Christian Bender
2018-07-25 16:37:10 +02:00
parent 89b94a8f52
commit c86ba856a8
52 changed files with 75 additions and 30618 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
DataStructures/Trees/TreeTraversal.java
View File

@ -19,19 +19,19 @@ public class TreeTraversal {
tree.insert(8);
// Prints 5 3 2 4 7 6 8
System.out.println("Preorder traversal:");
System.out.println("Pre order traversal:");
tree.printPreOrder();
System.out.println();
// Prints 2 3 4 5 6 7 8
System.out.println("Inorder traversal:");
System.out.println("In order traversal:");
tree.printInOrder();
System.out.println();
// Prints 2 4 3 6 8 7 5
System.out.println("Postorder traversal:");
System.out.println("Post order traversal:");
tree.printPostOrder();
System.out.println();
// Prints 5 3 7 2 4 6 8
System.out.println("Levelorder traversal:");
System.out.println("Level order traversal:");
tree.printLevelOrder();
System.out.println();
}
@ -39,7 +39,7 @@ public class TreeTraversal {
/**
* The Node class which initializes a Node of a tree
* Consists of all 3 traversal methods: printInOrder, printPostOrder & printPreOrder
* Consists of all 4 traversal methods: printInOrder, printPostOrder， printPreOrder & printLevelOrder
* printInOrder: LEFT -> ROOT -> RIGHT
* printPreOrder: ROOT -> LEFT -> RIGHT
* printPostOrder: LEFT -> RIGHT -> ROOT