Trees and binary search trees
Comes up in: DSA
This concept is being written. It gets the full five steps — explanation, predict, interview angle, practice with tests, and review cards. Here is exactly what it will cover, so you can study it elsewhere in the meantime.
What it covers
- terminology (root, leaf, height, depth)
- binary tree traversals (pre/in/post/level)
- BST property and operations
- balanced trees (AVL/red-black awareness)
Words you will know
What you will practise
- build a BST with insert/search/delete