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
  • 23. Reductions and Decomposition
  • 24. Hashing I
  • 25. Hashing II
    • 25.1 Hash Table Recap, Default Hash Function
    • 25.2 Distribution By Other Hash Functions
    • 25.3 Contains & Duplicate Items
    • 25.4 Mutable vs. Immutable Types
  • 26. Prefix Operations and Tries
  • 27. Software Engineering I
gitbookPowered by GitBook
block-quoteOn this pagechevron-down

25. Hashing II

By Mihir Mirchandani and William Lee

25.1 Hash Table Recap, Default Hash Functionchevron-right25.2 Distribution By Other Hash Functionschevron-right25.3 Contains & Duplicate Itemschevron-right25.4 Mutable vs. Immutable Typeschevron-right
Previous24.7 Exerciseschevron-leftNext25.1 Hash Table Recap, Default Hash Functionchevron-right

Last updated 6 days ago