Exercise 2.66 · 习题

Exercise 2.66: Implement the lookup

procedure for the case where the set of records is structured as a binary tree,

ordered by the numerical values of the keys.

练习 2.66：实现记录集合按键的数值大小有序地组织为二叉树情况下的 lookup 过程。