M-ary Search Tree

• Maximum branching factor of M

• Complete tree has depth = logMN

• Each internal node in a complete tree has

M - 1 keys

runtime:

Previous slide

Next slide

Back to first slide

View graphic version