Talk:Search tree
Jump to navigation
Jump to search
![]() | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||
|
![]() | This article links to one or more target anchors that no longer exist.
Please help fix the broken anchors. You can remove this template after fixing the problems. | Reporting errors |
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
Categories:
- C-Class Computing articles
- Low-importance Computing articles
- C-Class software articles
- Low-importance software articles
- C-Class software articles of Low-importance
- All Software articles
- C-Class Computer science articles
- Mid-importance Computer science articles
- All Computing articles
- Pages with broken anchors