check status online 的问题# Immigration - 落地生根
D*7
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 belonging to A, b belonging to B, and c
belonging to C must satisfy a <= b <= c. Give
a smallest possible counterexample to the professor’s claim.
教师手册上没给这题的答案，似乎是嫌它太简单。可我怎么也想不出来：（
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 belonging to A, b belonging to B, and c
belonging to C must satisfy a <= b <= c. Give
a smallest possible counterexample to the professor’s claim.
教师手册上没给这题的答案，似乎是嫌它太简单。可我怎么也想不出来：（
