Jump to content
Wikipedia The Free Encyclopedia

Talk:Binary search tree

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the talk page for discussing improvements to the Binary search tree article.
This is not a forum for general discussion of the subject of the article.
Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL
Archives : 1, 2, 3 Auto-archiving period: 30 days
Good article Binary search tree has been listed as one of the Engineering and technology good articles under the good article criteria. If you can improve it further, please do so. If it no longer meets these criteria, you can reassess it.
Article milestones
DateProcessResult
January 4, 2022 Good article nominee Not listed
April 11, 2022 Good article nominee Not listed
June 14, 2022 Good article nominee Listed
Current status: Good article
This level-5 vital article is rated GA-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:
WikiProject icon Mathematics High‐priority
WikiProject icon This article is within the scope of WikiProject Mathematics , a collaborative effort to improve the coverage of mathematics 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.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
High This article has been rated as High-priority on the project's priority scale.
WikiProject icon Computing Low‐importance
WikiProject icon 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
Low This article has been rated as Low-importance on the project's importance scale.
WikiProject icon Computer science High‐importance
WikiProject icon This article is within the scope of WikiProject Computer science , a collaborative effort to improve the coverage of Computer science related articles 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.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science
High This article has been rated as High-importance on the project's importance scale.
Things you can help WikiProject Computer science with:

Translation into Chinese Wikipedia

[edit ]

The version 10:23, 2 May 2025 is translated into the Chinese Wikipedia with modifications. 深鸣 (talk) 08:48, 11 May 2025 (UTC) [reply ]

Expanding coverage of the average case

[edit ]

"The complexity analysis of BST shows that, on average, the insert, delete and search takes O(log n) for n nodes"

This is a nontrivial fact and it would be good to have a source which provides a proof of it. (One such source is https://cs.umb.edu/~ryanc/24s/cs624/07-bst.pdf)

Additionally, stronger results on the behavior of "average" BSTs are known. For example, it has been proven that, if H_n is the height of a random BST with n elements then E[H_n] = a ln n + O (log log n) for a = 4.31107..., and that Var[H_n] = O((log log n)^2). source: https://luc.devroye.org/devroye_reed_1995_variance_height_random_binary_search_tree.pdf

In my opinion, stronger results, such as the one above, deserve to be mentioned in the article. Grassoc Oremaker (talk) 07:29, 26 September 2025 (UTC) [reply ]

AltStyle によって変換されたページ (->オリジナル) /