Course topics
- Know binary tree structures, tree traversals, binary search trees, heap, and B-trees.
- Understand serial and binary search, and open-address hashing.
- Can implement quadratic sort, recursive sort: divide-and-conquer, mergesort, quicksort, and heap sort.
- Be familiar with graph structures, implementation, traversals, and path algorithms.
- Get programming experience in managing trees and graphs and in implementing search and sort algorithms.
- Binary Search Tree
- Heaps
- Serach with Hash function
- Sorting (Bubble, Insertion, Merge, Quick, Selection)
- Graphing (DFS, BFS, Dijkstra)