Good candidates can arrive at the binary search tree as the right path in a few minutes, and then take 10-15 minutes working through the rest of the problem and the other roadblocks I toss out. But occasionally I get a candidate who ‘intuitively understands’ trees and can visualize the problem I’m presenting.
– Robert Love