Chapter 0 Binary Trees¶
- 0.1. Binary Trees Chapter Introduction
- 0.2. Binary Trees
- 0.3. Binary Tree as a Recursive Data Structure
- 0.4. The Full Binary Tree Theorem
- 0.5. Binary Tree Traversals
- 0.6. Implementing Tree Traversals
- 0.7. Information Flow in Recursive Functions
- 0.8. Binary Tree Node Implementations
- 0.9. Composite-based Expression Tree
- 0.10. Binary Tree Space Requirements
- 0.11. Binary Search Trees
- 0.12. Dictionary Implementation Using a BST
- 0.13. Binary Tree Guided Information Flow
- 0.14. Multiple Binary Trees
- 0.15. A Hard Information Flow Problem
- 0.16. Array Implementation for Complete Binary Trees
- 0.17. Heaps and Priority Queues
- 0.18. Huffman Coding Trees
- 0.19. Trees versus Tries
- 0.20. Proof of Optimality for Huffman Coding
- 0.21. Binary Tree Chapter Summary
