Binary search tree

• Definition

  • For any sub-tree
    • root->info > leftchild->info &&
    • root->info <= rightchild->info

In-order traversal:

4 5 6 9 11

Previous slide

Next slide

Back to first slide

View graphic version