CS61B Textbook Spring 2026
search
⌘Ctrlk
GitBook Assistant
GitBook Assistant
Working...Thinking...
GitBook Assistant
Good afternoon

I'm here to help you with the docs.

⌘Ctrli
AI Based on your contextquestion-circle
CS61B Textbook Spring 2026
  • Spring 2026 Textbook
  • Contributors
  • DISCLAIMER
  • 1. Introduction
  • 2. Defining and Using Classes
  • 3. References, Recursion, and Lists
  • 4. Testing
  • 5. SLLists
  • 6. DLLists and Arrays
  • 7. Resizing ArrayList
  • 8. Inheritance I: Interface and Implementation Inheritance
  • 9. Inheritance II: Subtype Polymorphism, Comparators, Comparables, Generic Functions
  • 10. Inheritance III: Iterators, Object Methods
  • 11. Asymptotics I
  • 12. Asymptotics II
  • 13. Asymptotics III
  • 14. Disjoint Sets
  • 15. Binary Search Trees
  • 16. B-Trees
  • 17. Red Black Trees
  • 18. Heaps and Priority Queues
  • 19. Tree Traversals and Graphs
  • 20. Graph Traversals and Implementations
  • 21. Shortest Paths
  • 22. Minimum Spanning Trees
    • 22.1 MSTs and Cut Property
    • 22.2 Prim's Algorithm
    • 22.3 Kruskal's Algorithm
    • 22.4 Chapter Summary
    • 22.5 MST Exercises
  • 23. Reductions and Decomposition
  • 24. Hashing I
  • 25. Hashing II
  • 26. Prefix Operations and Tries
  • 27. Software Engineering I
gitbookPowered by GitBook
block-quoteOn this pagechevron-down

22. Minimum Spanning Trees

By Teresa Luo and Mihir Mirchandani

22.1 MSTs and Cut Propertychevron-right22.2 Prim's Algorithmchevron-right22.3 Kruskal's Algorithmchevron-right22.4 Chapter Summarychevron-right22.5 MST Exerciseschevron-right
Previous21.5 Exerciseschevron-leftNext22.1 MSTs and Cut Propertychevron-right

Last updated 13 days ago