Back to Patterns
Trees & Trie
Master the Trees & Trie pattern
Total Problems
14
Difficulty
Easy0
Med14
Hard0
Curated Problems
| Status | Problem Title | Difficulty | Action |
|---|---|---|---|
| Phase 1: Must Do (Core Mechanics) | |||
| Implement Trie | Medium | Solve | |
| Level Order Traversal | Medium | Solve | |
| Zigzag Level Order | Medium | Solve | |
| Phase 2: Practice (Variations) | |||
| Construct BT from Preorder Inorder | Medium | Solve | |
| Design Add & Search Words | Medium | Solve | |
| Even Odd Tree | Medium | Solve | |
| Validate BST | Medium | Solve | |
| Phase 3: Advanced (Combinations) | |||
| Add One Row to Tree | Medium | Solve | |
| All Nodes Distance K | Medium | Solve | |
| Construct BST from Preorder | Medium | Solve | |
| Deepest Leaves Sum | Medium | Solve | |
| Maximum Binary Tree | Medium | Solve | |
| Maximum Width of Binary Tree | Medium | Solve | |
| Word Search II | Medium | Solve | |