C
C
CS61B Textbook
Search
⌃
K
Contributors
DISCLAIMER
1. Introduction
9. Extends, Casting, Higher Order Functions
11. Subtype Polymorphism, Comparators, Comparable
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
22.1 Tree Recap
22.2 Tree Traversals
22.3 Graphs
22.4 Graph Problems
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
29. Basic Sorts
30. Quicksort
31. Software Engineering II
32. More Quick Sort, Sorting Summary
33. Software Engineering III
34. Sorting and Algorithmic Bounds
35. Radix Sorts
36. Sorting and Data Structures Conclusion
37. Software Engineering IV
38. Compression and Complexity
39. Compression, Complexity, P = NP
Powered By
GitBook
22. Tree Traversals and Graphs
By Mihir Mirchandani and Dhruti Pandya
Here are the articles in this section:
22.1 Tree Recap
22.2 Tree Traversals
22.3 Graphs
22.4 Graph Problems
Previous
21.5 Exercises
Next
22.1 Tree Recap
Last modified
6mo ago