Practice45 min
Practice: Construction & Hard Paths
Iterative inorder, building from traversals, max path gain, and serialization with null markers.
The capstones: an explicit-stack inorder walk, rebuilding a tree from preorder plus inorder, the bubble-up pattern at its hardest, and preorder serialization with null markers.
Problems0 of 4 solved
- Not startedKth Smallest Element in a BSTinorder traversal (iterative stack)medium
- Not startedConstruct Binary Tree from Preorder and Inorder Traversalrecursion: preorder gives root, inorder splits subtreesmedium
- Not startedBinary Tree Maximum Path Sumpostorder DFS returning max gain, track global maxhard
- Not startedSerialize and Deserialize Binary Treepreorder DFS with null markershard