Talk:Binary search tree

This is the talk page for discussing improvements to the Binary search tree article.
This is not a forum for general discussion of the article's subject.

Put new text under old text. Click here to start a new topic.
New to Wikipedia? Welcome! Learn to edit; get help.

Article policies

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL

Archives: 1, 2, 3: 30 days

Template:Vital 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
Date	Process	Result
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 article has not yet been rated on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:

Mathematics

	Mathematics portal 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
???	This article has not yet received a rating on the project's priority scale.

Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.

Computing C‑class 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
C	This article has been rated as C-class on Wikipedia's content assessment scale.
Low	This article has been rated as Low-importance on the project's importance scale.

Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.

Computer science C‑class High‑importance

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

C

This article has been rated as C-class on Wikipedia's content assessment scale.

High

This article has been rated as High-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

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 contains broken links to one or more target anchors:

[[tree (data structure)#root nodes|root node]]

The anchors may have been removed, renamed, or are no longer valid. Please fix them by following the link above, checking the page history of the target pages, or updating the links.

Remove this template after the problem is fixed | Report an error

The currently misleading Deletion subsection

I edited the Deletion subsection to highlight the three distinct cases. Previously, the text said "three cases" but listed five. Someone quickly reverted this change to show five cases again (while the text still says three cases), simply with the explanation that "last version was better". I beg to differ, as the text vs list is simply misleading and as a matter of preference, I claim that my edit was a good improvement over the reverted version.

Please clarify what makes the old version better. Qrwe~enwiki (talk) 22:31, 10 July 2023 (UTC)[reply]

Deletion does have three cases: (1) if a node have no children, (2) if a node have one children, and (3) if a node have two children. In case (3) have two cases: if the node to be deleted (call it X) have both left and right children, we try to find X's successor (call it Y), and if (3a) Y is X's right child we replace X by Y, but if (3b) Y lies within X's right subtree but not X's right child, we first replace Y by its own right child, then replace X with Y.

So, deletion itself have three cases (1), (2), and (3); but (3) have two cases within (3a) and (3b).

It ought to be indented -- I will make the changes. --WikiLinuz {talk} 22:55, 10 July 2023 (UTC)[reply]