This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computing: Software / CompSci Low‑importance This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles Low This article has been rated as Low-importance on the project's importance scale. This article is supported by WikiProject Software (assessed as Low-importance). This article is supported by WikiProject Computer science (assessed as Mid-importance). Things you can help WikiProject Computer science with: history watch purge Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{ WikiProject Computer science}}

Tip: Anchors are case-sensitive in most browsers. This article links to one or more target anchors that no longer exist. [[Tree data structure#Terminologies used in Trees|leaves]] The anchor (#Terminologies used in Trees) is no longer available because it was deleted by a user before. [[Tree (data structure)#Terminology used in trees|height of the tree]] The anchor (#Terminology used in trees) is no longer available because it was deleted by a user before. Please help fix the broken anchors. You can remove this template after fixing the problems. | Reporting errors

"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) reply

This looks like the same page as Tree search. 108.93.181.106 ( talk) 15:27, 29 November 2017 (UTC) /info/en/?search=Tree_traversal reply