InOrder Traversal Algorithm

// InOrder traversal algorithm inOrder(TreeNode<T> n) { if (n != null) { inOrder(n.getLeft()); visit(n) inOrder(n.getRight()); } }

PreOrder Traversal Algorithm

// PreOrder traversal algorithm PreOrder(TreeNode<T> n) { if (n != null) { visit(n) PreOrder(n.getLeft()); PreOrder(n.getRight()); } }

PostOrder Traversal Algorithm

// PostOrder traversal algorithm PostOrder(TreeNode<T> n) { if (n != null) { PostOrder(n.getLeft()); PostOrder(n.getRight()); visit(n) } }