rishabh1403
/ LevelOrder.java
Created
July 30, 2016 09:19
Recursive and iterative LevelOrder tree traversal
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| //TODO add recursive | |
| import java.util.*; | |
| //Node class | |
| class Node{ | |
| int data; | |
| Node left; | |
| Node right; | |
| Node(int data){ |
rishabh1403
/ InOrder.java
Created
July 30, 2016 09:18
Recursive and Iterative InOrder Tree Traversal
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| //TODO add with morristraversal | |
| import java.util.*; | |
| //Node class | |
| class Node{ | |
| int data; | |
| Node left; | |
| Node right; | |
| Node(int data){ | |
| this.data = data; |
rishabh1403
/ PostOrder.java
Created
July 30, 2016 09:13
Recursive and iterative PostOrder tree traversal
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| //TODO add iterative with single stack | |
| import java.util.*; | |
| //Node class | |
| class Node{ | |
| int data; | |
| Node left; | |
| Node right; | |
| Node(int data){ | |
| this.data = data; | |
| this.left=null; |
rishabh1403
/ PreOrder.java
Created
July 30, 2016 08:04
Recursive and iterative Pre-order traversal of a BinaryTree
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| //TODO add morrisTraversal | |
| import java.util.*; | |
| //Node class | |
| class Node{ | |
| int data; | |
| Node left; | |
| Node right; | |
| Node(int data){ | |
| this.data = data; | |
| this.left=null; |