(opens new window) (opens new window) (opens new window)

• 一个关键字，会把区间分成两个分叉
• 4个关键字，会把区间划分为5个分区

(opens new window) (opens new window) (opens new window)

• 树这种结构，存储着22,5,11，......也可以用二分查找，因为每个节点内的数据都是按顺序排序的。

(opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window) (opens new window)

• 保证每个结点中的关键字不会太少，保证树不会变得太高，层数不会太多

• 不平衡，树之间的结点相差很大。

• 【策略】：m叉查找树中，规定对于任何一个结点，所有子树的高度都要相同

• 第2条和第5条都被包含在绝对平衡那个条件中了。