8. Trees and Tree Algorithms¶

Trees and Tree Algorithms

• 8.1. Objectives
• 8.2. Examples of Trees
• 8.3. Vocabulary and Definitions
• 8.4. Nodes and References
• 8.5. Parse Tree
• 8.6. Tree Traversals
• 8.7. Priority Queues with Binary Heaps
• 8.8. Binary Heap Operations
• 8.9. Binary Heap Implementation
  • 8.9.1. The Structure Property
  • 8.9.2. The Heap Order Property
  • 8.9.3. Heap Operations
• 8.10. Binary Search Trees
• 8.11. Search Tree Operations
• 8.12. Search Tree Implementation
• 8.13. Search Tree Analysis
• 8.14. Balanced Binary Search Trees
• 8.15. AVL Tree Performance
• 8.16. AVL Tree Implementation
• 8.17. Summary of Map ADT Implementations
• 8.18. Summary
• 8.19. Discussion Questions
• 8.20. Programming Exercises
• 8.21. Glossary