AMD interview question

How would you augment this binary tree to make searching O(n) time?