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

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
    • 14.1 Introduction
    • 14.2 Quick Find
    • 14.3 Quick Union
    • 14.4 Weighted Quick Union (WQU)
    • 14.5 Weighted Quick Union with Path Compression
    • 14.6 Exercises
  • 15. Binary Search Trees
  • 16. B-Trees
  • 17. Red Black Trees
  • 18. Heaps and Priority Queues
  • 19. Tree Traversals and Graphs
gitbookPowered by GitBook
block-quoteOn this pagechevron-down

14. Disjoint Sets

By Dhruti Pandya and Mihir Mirchandani

14.1 Introductionchevron-right14.2 Quick Findchevron-right14.3 Quick Unionchevron-right14.4 Weighted Quick Union (WQU)chevron-right14.5 Weighted Quick Union with Path Compressionchevron-right14.6 Exerciseschevron-right
Previous13.4 B-trees Big Ochevron-leftNext14.1 Introductionchevron-right

Last updated 8 days ago