# Section III: Trees

- [Chapter 10: Trees](/htaiwan/data-structures-and-algorithms/section-iii-trees/chapter-10-trees.md)
- [Chapter 11: Tree Challenge](/htaiwan/data-structures-and-algorithms/section-iii-trees/chapter-11-tree-challenge.md)
- [Chapter 12: Binary Trees](/htaiwan/data-structures-and-algorithms/section-iii-trees/chapter-12-binary-trees.md)
- [Chapter 13: Binary Tree Challenges](/htaiwan/data-structures-and-algorithms/section-iii-trees/chapter-13-binary-tree-challenges.md)
- [Chapter 14: Binary Search Trees](/htaiwan/data-structures-and-algorithms/section-iii-trees/chapter-14-binary-search-trees.md)
- [Chapter 15: Binary Search Tree Challenges](/htaiwan/data-structures-and-algorithms/section-iii-trees/chapter-15-binary-search-tree-challenges.md)
- [Chapter 16: AVL Trees](/htaiwan/data-structures-and-algorithms/section-iii-trees/chapter-16-avl-trees.md)
- [Chapter 17: AVL Tree Challenges](/htaiwan/data-structures-and-algorithms/section-iii-trees/chapter-17-avl-tree-challenges.md)
- [Chapter 18: Tries](/htaiwan/data-structures-and-algorithms/section-iii-trees/chapter-18-tries.md)
- [Chapter 19: Trie Challenges](/htaiwan/data-structures-and-algorithms/section-iii-trees/chapter-19-trie-challenges.md)
- [Chapter 20: Binary Search](/htaiwan/data-structures-and-algorithms/section-iii-trees/chapter-20-binary-search.md)
- [Chapter 21: Binary Search Challenges](/htaiwan/data-structures-and-algorithms/section-iii-trees/chapter-21-binary-search-challenges.md)
- [Chapter 22: The Heap Data Structure](/htaiwan/data-structures-and-algorithms/section-iii-trees/chapter-22-the-heap-data-structure.md)
- [Chapter 23: Heap Data Structure Challenges](/htaiwan/data-structures-and-algorithms/section-iii-trees/chapter-23-heap-data-structure-challenges.md)
- [Chapter 24: Priority Queue](/htaiwan/data-structures-and-algorithms/section-iii-trees/chapter-24-priority-queue.md)
- [Chapter 25: Priority Queue Challenges](/htaiwan/data-structures-and-algorithms/section-iii-trees/chapter-25-priority-queue-challenges.md)