YSC2229: Introductory Data Structures and Algorithms
  • 1. Course Syllabus
  • 2. Software Prerequisites
  • 3. OCaml Style Guide
  • 1. Week 01: Introduction
  • 2. Week 02: Working with Arrays
  • 3. Week 03: Complexity of Algorithms and Order Notation
  • 4. Week 04: Divide-and-Conquer Algorithms
  • 5. Week 05: Binary Heaps and Priority Queues
  • 6. Week 06: Abstract Data Types
  • 7. Midterm Project: Memory Allocation and Reclamation
  • 8. Week 07: Hashing-Based Data Structures
  • 9. Week 08: Searching in Strings
  • 10. Week 09: Backtracking and Dynamic Programming
  • 11. Week 10: Data Encoding and Compression
  • 12. Week 11: Binary Search Trees
    • 12.1. Representing Sets via Binary Search Trees
  • 13. Week 12: Graph Algorithms
  • 14. Week 13: Elements of Computational Geometry
  • 15. Final Project: Vroomba Programming
YSC2229: Introductory Data Structures and Algorithms
  • Docs »
  • 12. Week 11: Binary Search Trees

12. Week 11: Binary Search TreesΒΆ

  • 12.1. Representing Sets via Binary Search Trees
    • 12.1.1. A Data Structure for Binary-Search Trees
    • 12.1.2. Inserting an element into a BST
    • 12.1.3. Binary-Search-Tree Invariant
    • 12.1.4. Testing Tree Operations
    • 12.1.5. Printing a Tree
    • 12.1.6. Searching Elements
    • 12.1.7. Tree Traversals
    • 12.1.8. Testing Element Retrieval and Tree Traversals
    • 12.1.9. More BST operations
    • 12.1.10. Deleting a node from BST
    • 12.1.11. BST Rotations
Next Previous

© Copyright 2021, Ilya Sergey

Built with Sphinx using a theme provided by Read the Docs.