Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Merge pull request #164 from KyleScharnhorst/master

Browse Source 
Add: level order traversal.
This commit is contained in:
Varun Upadhyay 2017-10-10 11:29:02 -07:00 committed by GitHub
commit 7dacb2f837
1 changed files with 27 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
data_structures/Trees/TreeTraversal.java
View File

@ -3,6 +3,7 @@
* @author Varun Upadhyay (https://github.com/varunu28) * @author Varun Upadhyay (https://github.com/varunu28)
* *
*/ */
import java.util.LinkedList;
// Driver Program // Driver Program
public class TreeTraversal { public class TreeTraversal {
@ -10,18 +11,25 @@ public class TreeTraversal {
Node tree = new Node(5); Node tree = new Node(5);
tree.insert(3); tree.insert(3);
tree.insert(7); tree.insert(7);
tree.insert(1);
tree.insert(9);
// Prints 3 5 7 // Prints 1 3 5 7 9
tree.printInOrder(); tree.printInOrder();
System.out.println(); System.out.println();
// Prints 5 3 7 // Prints 5 3 1 7 9
tree.printPreOrder(); tree.printPreOrder();
System.out.println(); System.out.println();
// Prints 3 7 5 // Prints 1 3 9 7 5
tree.printPostOrder(); tree.printPostOrder();
System.out.println(); System.out.println();
// Add a couple more nodes for print level test
// Print 5 3 7 1 9
tree.printLevelOrder();
System.out.println();
} }
} }
@ -31,6 +39,7 @@ public class TreeTraversal {
* printInOrder: LEFT -> ROOT -> RIGHT * printInOrder: LEFT -> ROOT -> RIGHT
* printPreOrder: ROOT -> LEFT -> RIGHT * printPreOrder: ROOT -> LEFT -> RIGHT
* printPostOrder: LEFT -> RIGHT -> ROOT * printPostOrder: LEFT -> RIGHT -> ROOT
* printLevelOrder: ROOT -> ROOT's CHILDREN -> ROOT's CHILDREN's CHILDREN -> etc
*/ */
class Node { class Node {
Node left, right; Node left, right;
@ -88,5 +97,20 @@ class Node {
} }
System.out.print(data + " "); System.out.print(data + " ");
} }
public void printLevelOrder() {
LinkedList<Node> queue = new LinkedList<>();
queue.add(this);
while(!queue.isEmpty()) {
Node n = queue.poll();
System.out.print(n.data + " ");
if (n.left != null) {
queue.add(n.left);
}
if (n.right != null) {
queue.add(n.right);
}
}
}
} }