梦到被amgen招进去了# Biology - 生物学
g*v
1 楼
Professor Bunyan thinks he has discovered a remarkable property of binary
search trees. Suppose that the search for key k in a binary search tree ends
up in a leaf.
Consider three sets: A, the keys to the left of the search path; B, the keys
on the search path; and C , the keys to the right of the search path.
Professor Bunyan claims that any three keys a \in A, b \in B, and c 2\in C
must satisfy a <= b <= c. Give a smallest possible counterexample to the
professor’s claim.
我怎么觉得是对的，实在是想不出counterexample。
哪位可以指点一下，谢谢。
search trees. Suppose that the search for key k in a binary search tree ends
up in a leaf.
Consider three sets: A, the keys to the left of the search path; B, the keys
on the search path; and C , the keys to the right of the search path.
Professor Bunyan claims that any three keys a \in A, b \in B, and c 2\in C
must satisfy a <= b <= c. Give a smallest possible counterexample to the
professor’s claim.
我怎么觉得是对的，实在是想不出counterexample。
哪位可以指点一下，谢谢。
