Traversal

Traverse a binary tree in inorder (left -> root -> right)

Traverse a binary tree in preorder (root -> left -> right)

Traverse the boundary of a binary tree in anti-clockwise direction.

Implement breadth-first search traversal of a graph

Construct a binary tree from preorder and inorder traversal sequences.

Implement depth-first search traversal for graphs

Traverse binary tree in postorder (left, right, root)

Traverse a binary tree level by level in zigzag order