trees
3 problems, easiest first. Every one is open — nothing here is locked behind the others.
0 / 3 solved
| Solved | Problem | Topic | Difficulty |
|---|---|---|---|
| Validate Binary Search Tree | trees | medium | |
| Binary Tree Level Order Traversal | trees | medium | |
| Maximum Depth of a Tree | trees | medium |
Then build one
These problems are one function each. A build challenge is the same ideas assembled into a working thing across several files.
- Binary Search TreeConstruct a Binary Search Tree with node pointers, recursive insertion, lookup, in-order traversal, and 3-case deletion.4 stepsjavascript · pythonmedium
- Prefix Tree (Trie)Construct an n-ary Prefix Tree with character node branching, word insertion, prefix search, and auto-complete.4 stepsjavascript · pythonmedium
Stuck on the pattern rather than the problem? The trees lesson walks through it with an animation you can step through.