C
C
CS61B Textbook
Search…
⌃K
Contributors
DISCLAIMER
1. Introduction
9. Extends, Casting, Higher Order Functions
11. Subtype Polymorphism, Comparators, Comparable
11.1 A Review of Dynamic Method Selection
11.2 Subtype Polymorphism vs Explicit Higher Order Functions
11.3 Comparables
11.4 Comparators
11.5 Chapter Summary
11.6 Exercises
12. Exceptions, Iterators, Object Methods
13. Asymptotics I
14. Disjoint Sets
15. Asymptotics II
16. ADTs and BSTs
17. B-Trees
18. Red Black Trees
19. Hashing I
20. Hashing II
21. Heaps and Priority Queues
22. Tree Traversals and Graphs
23. Graph Traversals and Implementations
24. Shortest Paths
25. Minimum Spanning Trees
26. Prefix Operations and Tries
27. Software Engineering I
28. Reductions and Decomposition
Powered By GitBook

11. Subtype Polymorphism, Comparators, Comparable

In this chapter of the textbook we will be:
  • Reviewing Dynamic Method Selection
  • Defining Subtype Polymorphism and contrasting it against Explicit Higher Order Functions
  • Seeing Applications of Subtype Polymorphism in:
    • Comparators
    • Comparables
The following videos for Lecture 10 correspond to the content for this chapter of the textbook.
Previous
9.5 Exercises
Next
11.1 A Review of Dynamic Method Selection
Last modified 1mo ago
Copy link