Frage im Vorstellungsgespräch bei Amazon
The best implementation for a binary tree.
Antwort im Vorstellungsgespräch
Anonym
6. Aug. 2013
In-order search. Because you just need to locate the root value, and then the left side of the root value is the left tree, and the right side of the root value is the right tree.