Multi-D Search ADT

• Dictionary operations

  • create
  • destroy
  • find
  • insert
  • delete
  • range queries

• Each item has k keys for a k-dimensional search tree

• Searches can be performed on one, some, or all the keys or on ranges of the keys

Previous slide

Next slide

Back to first slide

View graphic version