Talk:Search tree

Diagram needed

 * "This means that for any internal node containing a value v, the values x stored in its left subtree satisfy x ≤ v, and the values y stored in its right subtree satisfy v ≤ y. Each subtree of a search tree is by itself again a search tree."

This single sentence sums up the nature of a search tree brilliantly. I imagine that folks less comfortable with algebra will have trouble with it though. An example diagram will get the point across well. JKeck (talk) 16:23, 31 July 2013 (UTC)

Duplicate article
This looks like the same page as Tree search. 108.93.181.106 (talk) 15:27, 29 November 2017 (UTC) https://en.wikipedia.org/wiki/Tree_traversal