Balanced vs skewed

Tree shape changes search-path length. Balanced BST height is logarithmic; a skewed BST can have linear height.

Remember: Same keys; different path lengths.

Example: Keys 1,2,3 can form a 3-level chain or a 2-level tree.

Time: Search O(h): balanced O(log n), skewed O(n). Auxiliary space: Traversal O(w) queue.

Complexities describe the underlying algorithm; tutorial snapshots and rendering can use additional resources.

The interactive workspace loads here when JavaScript is available. You can still browse the learning notes and links above without it.