CSM CS61B Midterm 2 Review Session Spring '25 (part 2)
Location: HP Auditorum in Soda Hall, Berkeley
Disclaimer: Computer Science Mentors at UC Berkeley is not affiliated with CS61B course staff.
Topics covered in this (part2) portion of the review session:
Hibbard deletion, pre-order & post order traversals, left-leaning red-black trees, 2-3 Trees, depth-first search & breadth first search for arbitrary graph, Djikstra's algorithm for shortest paths, Minimum Spanning Trees (MSTs), Prim's Algorithm, Cut Property for MSTs.