Loading...
Distinguish directed, undirected and weighted graphs
Implement updates to an undirected adjacency representation
Distinguish trees, rooted trees and binary trees
Maintain the BST ordering invariant during deletion
Apply a simple hash function
Trace linear probing with wraparound
Work through each topic to complete the section.