Preview: Part 3 and Part 4 Structures and Commands

As discussed earlier in Section 3, you will implement B+ tree deletion in Part 3. In Part 4, we expect you to implement REDUCE_KEY for the f-heap, then use the Fibonacci heap to implement Dijkstra's algorithm. The information in this section is provided as a courtesy, and is exempt from the freezing rules for Part 2.

Web Accessibility