Traverse a Binary Tree in InOrder, PreOrder, and PostOrder
class Tree <T> { Node<T> root; public <T> Tree(Node<T> root) { this.root = root; } public void inOrder() { inOrder(root); } private void inOrder(Node node) { if (node != null) { inOrder(node.getLeft()); System.out.print(node.getValue()); inOrder(node.getRight()); } } public void preOrder() { preOrder(root); } private void preOrder(Node node) { if (node != null) { System.out.print(node.getValue()); preOrder(node.getLeft()); preOrder(node.getRight()); } } public void postOrder() { postOrder(root); } private void postOrder(Node node) { if (node != null) { postOrder(node.getLeft()); postOrder(node.getRight()); System.out.print(node.getValue()); } }
No comments:
Post a Comment