Navigation

  • index
  • next |
  • previous |
  • IanFang Course Note Hosting documentation »
  • COP 4534 Data Structure and Algorithm Design II »
  • Module 3 Tree Revisit; AVL Tree

Module 3 Tree Revisit; AVL TreeΒΆ

In module 3, we will revisit the tree data structure and introduce a new type of tree called AVL tree.

Topics

  • Tree Data Structure
    • Tree
    • Binary tree
  • Binary search tree
    • Motivation
    • Definition
    • Applications
    • Behaviors
    • Implementation Details
    • Drawbacks and Solutions
    • Applications of BST
  • Self-balancing Trees
    • Definition
    • Motivation
    • Variations
  • AVL Tree
    • Definition
    • Characteristics

Previous topic

Amortized Analysis

Next topic

Self-balancing Trees

This Page

  • Show Source

Quick search

Navigation

  • index
  • next |
  • previous |
  • IanFang Course Note Hosting documentation »
  • COP 4534 Data Structure and Algorithm Design II »
  • Module 3 Tree Revisit; AVL Tree
© Copyright 2021-2024, Ian Fang. Created using Sphinx 8.1.3.