Study Items for Exam 2

1. Identify which tree belonging _______:
   1. Binary Tree
   2. Complete Binary Tree
   3. Binary Search Tree
   4. Max-Heap
   5. Min-Heap
2. Build a Binary Search Tree & traverse
3. Build a Red-Block Tree
4. Advantage of Red-Block Tree over Binary Search Tree
5. Radix-Sort
6. Stable Sort

---

7. Time to insert / search a node in a Binary Search Tree:
   • Average Time
   • Best-Case Time
   • Worst-Case Time
8. Breadth First Search
9. Depth First Search