Binary search tree

• Definition

  • For any sub-tree
    • root->info > left->info &&root->info <= right->info

In-order traversal:

4 5 6 9 11

Previous slide

Next slide

Back to first slide

View graphic version