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.

Learn BFS traversal with a FIFO queue + visited set. Includes BFS pseudocode, example, and O(V+E) complexity—practice for FAANG interviews.

Construct a binary tree from preorder and inorder traversal sequences.

Implement depth-first search traversal for graphs

Solve binary tree zig zag/spiral traversal with optimal BFS + deque. O(n) time, O(w) space. Step-by-step for interviews—practice now.

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