Jump to content

Talk:Binary search tree/Archive 2

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
Archive 1Archive 2Archive 3

No Duplicates?

It seems that there is disagreement in the definition of a binary search tree. The article currently says that there must be no duplicates (and there are sources online that back it up), but many standard implementations of BSTs support duplicates, and Nick Parlante, at Stanford, says that they can contain duplicates (http://cslibrary.stanford.edu/110/BinaryTrees.html). Does anyone have an authoritative source (eg, CLRS or something by Knuth) on the subject? Meviin (talk) 21:15, 27 November 2013 (UTC)

There's also this - in direct contradiction - "The BST property--every node on the right subtree has to be larger than the current node and every node on the left subtree has to be smaller than (or equal to) the current node"
It's not even mentioned in many trees-related articles I've seen here. Either duplicates are permitted or they're not, but it's often not stated. If there's some disagreement about this, at least note it, rather than hoping no on will notice the omission. Also, if you are going to assume yes or no, make sure that all the rest of the article complies.

--Akwillis1 (talk) 22:58, 17 August 2014 (UTC) A value is greater, lesser, or equal to the node, it can't be a combination, so effectively there can't be duplicates. If these rules are broken then the invariant associated with the bst breaks. You can effectively think of a bst as a concrete implementation of the abstract data type Set.

isBST method code

The code checks the validity of BST is, in my opinion, wrong. At least, clarification should be added. First, I think rightData & leftData are always MinValue & MaxValue (respectively), instead of changing and checking all the nodes across the tree. Second, it seems like these fields should be vice versa (i.e, the right should be left and vice versa). 06:41, 9 July 2014 (UTC)

I was thinking the same thing, and am glad to see I'm not the only one. I'll look into it more. Huttarl (talk) 21:05, 19 July 2014 (UTC)

Comparisons and the "less-than function"

The Operations section states:

A common comparator is the less-than function

This sentence, and the paragraph it appears in, suffer from a rather unfortunate choice of concepts to explain orders and comparisons. Making a distinction between less-than and comparison functions is language-specific; in languages with operator overloading, it can lead to circular definitions because less-than in fact has to be implemented in terms of what this paragraph calls a "comparator". I'd rather we skip the notion of a comparator and just introduce <, > as notation for some type/problem-specific ordering. QVVERTYVS (hm?) 10:36, 10 February 2015 (UTC)

Bulk operations

I've been wanting to write something about this, but couldn't get my sources together, so I'll dump my thoughts here for now in the hopes that others can help. It is possible to implement the insert, delete and lookup operations in terms of two helper routines:

  • split(T, k) splits a tree into two trees L and R, where L contains all keys in T less than k and R all keys greater than T (with k itself assigned to L, or R, or neither).
  • join(L, R) merges two trees; it may assume all keys in L are less than all keys in R.

With these, it is also possible to implement union, intersection and set difference much more efficiently than by just running repeated insertions, lookups and deletions.

Sources so far:

QVVERTYVS (hm?) 11:09, 10 February 2015 (UTC)

To be sure, I'm not talking about the naive join algorithm that you can find on various places on the web, which takes O(n + m) time (turn L into a list, turn R into a list, turn list back into a BST). The problem is apparently solvable in O(log m + n) time, which means implementing insertion in terms of join is feasible. QVVERTYVS (hm?) 16:51, 10 February 2015 (UTC)
Ok, found it. These operations are commonly associated with treaps and discussed in, e.g., this paper. I'm not sure if adding them to this article makes much sense. QVVERTYVS (hm?) 11:12, 12 February 2015 (UTC)

TreeNode

The symbol TreeNode is used in the article twice in different sense. In the first case it is used as a subroutine with 4 arguments in subroutine binary_tree_insert without a definition. The second case is a struct defined in Binary search tree#Verification. --Nomen4Omen (talk) 20:04, 3 November 2015 (UTC)

Types

There appears to be some differences in the introduction and the other sections of the article relating to balancing. From my reading the article seems that both balanced and unbalanced are claimed. I may have read it wrong.

Introduction

From the introduction: "They are a special case of the more general B-tree with order equal to two."

Can be omitted. History went BST --> self-balancing tree --> B-tree. So the generalization to orders > 2 took with it the self-balancing property. This is best explained at B-tree and not at BST. --Nomen4Omen (talk) 16:53, 4 November 2015 (UTC)

B-tree

From the B-Tree article: "In computer science, a B-tree is a self-balancing tree data structure ..."

Conflict disappears after previous edit. --Nomen4Omen (talk) 16:53, 4 November 2015 (UTC)

Types

From the Types section: "Two other titles describing binary search trees are that of a complete and degenerate tree." and then "A degenerate tree is a tree where for each parent node, there is only one associated child node. It is unbalanced and, in the worst case, performance degrades to that of a linked list." Jonnypurgatory (talk)

The article describes BSTs. These are NOT NECESSARILY balanced, they MAY be balanced. The balanced resp. self-balancing trees are the more interesting ones, but of course they have properties with BSTs in common. --Nomen4Omen (talk) 16:53, 4 November 2015 (UTC)

Hello fellow Wikipedians,

I have just modified 2 external links on Binary search tree. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).

  • If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
  • If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 15:44, 20 July 2017 (UTC)

Codes

Why are codes in all languages? Some in Python. Some in C++. Sherwilliam (talk) 13:29, 12 October 2019 (UTC)

I mean if you want both languages, then program all functions in both. Now half is in python and half in C++. Sherwilliam (talk) 16:15, 12 October 2019 (UTC)

Why empty leaves?

Why do leaves not store keys? It's better to define the leaves as the nodes that have no children, but still store a key. -Pgan002 (talk) 05:15, 3 June 2020 (UTC)

In principle good question and remark. But as far as I can see, the use of the terms leaf, internal leaf, external leaf, node carrying a key, node without key differs slightly among the authors Knuth, Sedgewick, Mehlhorn et al and maybe even between AVL and RB of the same author. I propose not to use such a term in the intro or use it with great care. Maybe it is useful to juxtapose two such views early in an article like "BST" (or "BT") and then restrict the terminology throughout the rest of the article(s). - Nomen4Omen (talk) 06:23, 3 June 2020 (UTC)

Python-function NodeTree

Does somebody know a little more about the (undeclared) Python-function "NodeTree(None, key, value, None)" in the section Binary search tree#Insertion​? Maybe even insert a code snippet? The purpose should be to show an example of a persistent data structure. - Nomen4Omen (talk) 18:41, 5 June 2020 (UTC)

search_duplicatesAllowed always returns None

while-loop condition is 'current_node != None', and this is the only case to exit the loop.

You are right: needed are 2 variables. I tried to improve, but do not know Python very well. Would you pls look at it? −Nomen4Omen (talk) 07:30, 19 April 2021 (UTC)

Changes of WikiLinuz as of 30 July 2021

[Section moved from User_talk:WikiLinuz to here, so that other users who are interested in the article can participate in the discussion more easily.] ―Nomen4Omen on 31 July 2021

In my opinion some of your additions to Binary search tree are completely misplaced, so I'm thinking of throwing them out:

The sentence begins "Deleting a node D with two children:" from this it is clear that D has a left and a right subtree. This means that your lengthy footnotes about predecessor and successor are extremely pointless. ―Nomen4Omen (talk) 08:27, 30 July 2021 (UTC)

There is no implementation and "proper" explanation of the actual process of finding the in-order pred/successor on the article. The diagram merely explains the actual process of deleting the node and limited to a single case. The explanation below the image is too vague for one to implement. There neither exists actual code example which explains/supports the explanation and various cases/caveats involved nor disambiguous explanation of various cases. So, I don't find any reason to "throw them out". WikiLinuz (talk) 08:51, 30 July 2021 (UTC)
I assume that you saw the title "Deletion" of the section. You try to tell me that «there is no implementation and "proper" explanation of the actual process of finding the in-order pred/successor on the article.» This may be true, but is another issue. In the present context of deletion there is no need to explain the general «process of finding the in-order pred/successor» (only the «actual» i.e. restricted to deletion) and your 2 footnotes are much too thick: e.g. the snippet find_min is sufficient which btw. resembles very much your Case 1. Your Case 2 is totally superfluous in the deletion context.
Of course, it's up to you to insert an «implementation and "proper" explanation of the actual process of finding the in-order pred/successor». But please choose another section for doing that. ―Nomen4Omen (talk) 17:03, 30 July 2021 (UTC)
Which another section are you talking about? Do you want me to create a new sub-section which is dedicated for the notes with all the cases? If you meant that, I've thought of doing that but, the process of finding in-order pred/successor is specific to deletion in BST, so I don't think it best fits the format of the current article. The cases and explanation as a note, like it is on the current version, is good enough. I don't think any modification to the placement of the note is necessary. WikiLinuz (talk) 17:46, 30 July 2021 (UTC)
It is not me to think or talk about another section. This is totally and absolutely your issue: You are introducing contents which is not appropriate to the section. After having introduced this horribly sophisticated code, it should be no problem for you to find an appropriate place for it. ―Nomen4Omen (talk) 09:54, 31 July 2021 (UTC)
There is absolutely no need for the content to be removed. You did not provide a valid reason. DO NOT revert valid edits. I've clearly informed, in plain English, to you about why the note has to be presented there, since it lacks the explanation. DO NOT touch my edits, since you don't have any valid points to present. —— WikiLinuz (talk) 13:26, 1 August 2021 (UTC)

The explanation of my reverts (all of them I consider valid) of your edits is already in this talk. But as you seem to have problems with reading, I repeat:

  1. Not I was beginning to revert, but you.
  2. Furthermore, your footnotes are misplaced, as I tried to explain in this talk. I said (09:54, 31 July 2021 (UTC) above) that “You are introducing contents which is not appropriate to the section.”
  3. You gave in by yourselves (17:46, 30 July 2021 (UTC) above) that you «thought of doing that (i.e. creating a new sub-section) but, the process of finding in-order pred/successor is specific to deletion» ― a statement which is not true. (And after doubting, you now say «I've clearly informed, in plain English, to you about why the note has to be presented there». But the doubt is justified.)
  4. Namely, finding in-order pred/successor is in-order traversing. And there is indeed the article Tree traversal containing several sections about in-order traversal and pred/successor. And this is the true place where the subject belongs to. And there had existed a link to one of these sections which you have thrown out with the remark «rm unwanted linkage;».
  5. I gave you the chance to enter a section for your in-order pred/successor subject from 09:54, 31 July 2021‎ where you have been active 12:37 and 23:49, 31 July 2021 without answering, so I reverted your footnotes 09:38, 1 August 2021 without a loss of information as far as the article is concerned.

By the way, it is terribly misleading to the readers to name both Cases 1 and 2 inorder_predecessor resp. inorder_successor!!! What shall a user do with this intentionally ambiguous information??? And as already mentioned above, the 2 Case 2 footnotes have nothing to do with deletion. Moreover, they are of really bad quality in that they refer to the node’s key which can (and should!) be avoided as shown in Tree_traversal#Single_in-order.

So, under observation of the WP-rules I do not intend to tolerate your deterioration of the article. ―Nomen4Omen (talk) 15:38, 1 August 2021 (UTC)

  1. I don't understand why you mean by you was not beginning to revert. You clearly reverted the note edits. See 9 edits of revert from [[1]]
  2. Why are you saying that it's misplaced? It's placed in the specific section where the discussion of in-order successor and predecessor comes in. And in the case of BST, finding in-order predecessor and successor is specific to the process of deletion. So, the note explaining various caveats or specific cases is placed in such a location.
  3. I was specifying that point, because explaining various cases involved in finding the in-order predecessor and successor is a step *within* the deletion process. Because, it is in the deletion that one needs to find those nodes. So, since it's within the process of deletion, having a footnote which mentions the cases in the deletion subsection is appropriate, since the explanation doesn't need a separate sub section or a separate article for the reasons I mentioned.
  4. Finding in-order successor and predecessor is not just in-order traversal. That is incorrect. If you're in an arbitrary location/node in a BST, and you wanna find the in-order successor or predecessor of the current node, unless you have an array or map of all the nodes in in-order fashion which you've pre-traversed and stored in some location(which is horribly inefficient), you cannot find in-order predecessor or successor. You must have to follow the step that are specified on the footnote. And following the process have two caveats like mentioned on the note.
  5. Like I mentioned on point 3, the reason why anyone wanna find an in-order successor or a predecessor of a current node is in the process of deletion. So, it has to be within the deletion process. And having a minimal footnote in the right place where the discussion of finding in-order predecessor and successor is, as per the format of the current article, the appropriate thing to do. Which doesn't clutter the deletion subsection, since it's kept as a footnote.
  6. And there indeed two cases which the original article doesn't cover. Because the the reasons I mentioned on the notes. You cannot find the predecessor of a node with just case one. There are two cases involved in finding the in-order predecessor. And same applies to the successor.

And for these reasons, the footnote doesn't deteriorate the article, so I didn't violate any of WP's rules like you mentioned. —WikiLinuz (talk) 16:55, 1 August 2021 (UTC)

My reply:
To your 1: You mention my edit 09:16, 1 August 2021. But you started reverting, as I already mentioned above, on 06:07, 30 July 2021‎ (rm unwanted linkage;). Moreover, this is a very important link, because it gives you the hint to in-order predecessor and successor. But you only say «rm unwanted linkage;».
To your 2: I said above 08:27, 30 July 2021: “The sentence begins "Deleting a node D with two children:" from this it is clear that D has a left and a right subtree.” So the Cases 2 which address nodes without children, are misplaced in this context.
To your 3: I agree «finding the in-order predecessor and or successor is a step *within* the deletion process» (btw., one of the two is good enough ― and had been addressed by the link you threw out). But the Cases 2 do not occur with deletion, although with traversal. So these cases are inappropriate as I said.
To your 4: As pointed out in Tree_traversal#Single_in-order iterativeInorderUpwards, it IS possible to find in-order predecessor or successor. It is NOT necessary «to follow the step that are specified on the footnote». (And it can be done in .)
To your 5: Small objection to «the reason why anyone wanna find an in-order successor or a predecessor of a current node is in the process of deletion». This idea is due to T.N. Hibbard and is a good one. But there are also other solutions.
To your 6: I do not exactly know what you mean by «indeed two cases which the original article doesn't cover». But, if you mean your Cases 2, then here is indeed NO NEED to cover them in the given context of deletion, as already said earlier and again in To your 3. These Cases 2 are to be handled with traversal, as already said.
To your 7: I did NOT say that you «violate any of WP's rules like you mentioned». I said: “So, under observation of the WP-rules I do not intend to tolerate your deterioration of the article.” In summary, I'm not sure what you read and what you understand.
By the way, I had a short look into your function Case_2.inorder_predecessor.
  1. How does root_bst get into the function?
  2. If input_node == root_bst, then right_node and right_node->left appear undefined to me. So the function crashes.
Best regards, ―Nomen4Omen (talk) 19:13, 1 August 2021 (UTC)
  1. The root_bst on my specific code is supposed to be specified by the user and it's an implementation detail. We "assume" that root_bst is a pointer to the root node of the BST, and leave it to the user to implement such a detail.
  2. You are correct, right_node is supposed to be replaced with temp_node. That is a typo from my part.

And regarding you mention of "one of those are good enough", that isn't the point of a Wikipedia article. You mention both, in-order successor and predecessor in the article and explain the caveats/cases, implement one of the two on the code part of the article, and leave it to the user to choose, either in-order successor or predecessor on *their* implementation, without having to restrict a user/reader to "one specific method" and "one specific case from a diagram". —WikiLinuz (talk) 19:45, 1 August 2021 (UTC)

Changes on 16 Aug 2021​

  1. Ordering R/O-operations together before R/W-operations Insertion, Deletion.
  2. in-order ===> inorder
  3. Introduction of the ancestor stack (as part of a "traverser")
  4. New section "Advancing to the next or previous node" as a piecewise kind of traversal, well suited to iterative programming
  5. Insertion after some iterative search

–Nomen4Omen (talk) 08:25, 16 August 2021 (UTC)

Contributions of 134.19.119.156 on 17 Aug

@WikiLinuz:

[Obviously, we are both observers of the article Binary search tree.]

Indeed, user 134.19.119.156 is absolutely right in assessing your Case 2 footnotes as inferior compared to my Part B in section Binary search tree#Advancing to the next or previous node at least wrt. efficiency. It is easy to see that –at least for balanced trees (which are the important cases)– your Case 2 has an average performance of O(h)=O(log n) whereas mine has O(1).

So your two Case 2 footnotes have at least two drawbacks:

  1. Misplacement in section Deletion (as already pointed out in the talk page above)
  2. Bad performance

So it would really be interesting where you see the «superiority» as you have remarked in your edit summary. And I am expecting an answer. –Nomen4Omen (talk) 17:08, 17 August 2021 (UTC)

The 'superiority' comes in because your code is too messy for the page. I mean, I don't think you did a peer-review of the contribution before making such a larger changes. You must cleanup the code that you've submitted. Compared to the mess, the code I submitted is 'straightforward'. And it is not misplaced. Because, like I already mentioned, the only place where you'd need to find and check against those cases is on deletion. And the user <IP> is a possible WP:SOCK. —WikiLinuz (talk) 01:58, 18 August 2021 (UTC)
At least, there is a reaction. Thanks!
But there are still questions:
  1. What do you mean by «too messy»? Too many lines?
  2. Is it less messy to have lengthy footnotes?
  3. Did you do a peer-review before your «rm unwanted linkage;» on 6:07 30 July ?
    Did you explain why it is «unwanted» or isn't it just you single only who does not «want» it?
    It was a link to another article which was explaining suc/predecessor and navigating from a node backward or forward. A navigating sample which I imported in C shape into the section "Advancing to the next or previous node".
You say your code is «straightforward»! I admit, your Cases 1 are straightforward. But they are essentially the same as the Python sample find_min directly below which has been in the article prior to your Cases 1.
  1. Is it straightforward to give two different functions the same name inorder_successor? What shall the reader think about such a naming? Do these functions do the same? (Same question for inorder_predecessor)
  2. Is it straightforward to enter code samples with inferior performance?
  3. Did you give a source for your strange proposals?
  4. Indeed: you already mentioned «the only place where you'd need to find and check against those cases is on deletion». But you are totally wrong with this statement. The source I give (Ben Pfaff) gives his code piece almost the same name, namely "Advancing to the Next Node". It is very common e.g. in connection with data bases to start at a certain key and then advance (search) sequentially from this on for a possible final result. Why do you insist to suppress this more general view of piecemeal navigation or traversal? (Ben Pfaff spends a chapter to it!)
  5. Your Cases 2 are never needed in the context of deletion (they are misplaced as I say).
  6. Your Cases 2 require knowledge of key and comparison function which is NOT needed by the alternative.
  7. Your Cases 2 do not work when duplicates are allowed in the tree, whereas the alternative does.
  8. Your Cases 2 have worse performance, because they always start from the tree's root (highest level), whereas the alternative mainly navigates in the levels close to the leaves where the big majority of nodes are.
  9. What do you mean by your strange comment «using case 2’s traversal technique»? Isn't then simple end-of-navigation (which has to happen some time and which has to be told to the user)?
User 134.19.119.156 was right in detecting the redundancy (superfluousness) of your footnotes in that version and in removing them.
–Nomen4Omen (talk) 08:40, 18 August 2021 (UTC)
You've to first contribute clean code if you want the readers to understand what you're trying to convey, the code that you've provided is 'ugly'. If you disagree, compare your version to that of other articles. By performance, have you looked into the space complexity of your solution? You must consider and explicitly mention the space complexity of the solution when you're submitting a specialized code, a specific kind of traversal method. There are always trade-offs when there are multiple implementations. There are also multiple grammatical errors on your contribution, which makes it really confusing to grasp. Clean up your code, and make it 'non-ugly', expand the acronyms, and explicitly mention about the space complexity of your solution, not just 'time'. On my code sample, it's pretty standard method of implementation. If you're only talking about 'performance', obviously, there are multiple other ways to gain much higher performance than the code that you've provided, but that'd just take higher space, just like yours. And my code sample explicitly deals with finding inorder pred/succ in a more generalized case, not compared to yours which is highly specialized and deeply coupled to one specific type of traversal that depends on internal members. That isn't what generalization means. Given that, there isn't any need for generalized samples to be taken out. —WikiLinuz (talk) 13:40, 18 August 2021 (UTC)

Request for 3O

On 19 Aug 2021 user:Nomen4Omen had entered the following line into WP:Third opinion#Active disagreements:

  # Talk:Binary_search_tree#Changes of WikiLinuz as of 30 July 2021. Disagreement about placement and naming of functions and since yesterday about 'ugliness'. 07:33, 19 August 2021 (UTC)

–Nomen4Omen (talk) 13:47, 23 August 2021 (UTC)

Response to third opinion request:

Dear WikiLinuz and Nomen4Omen; good afternoon from the UK. I am Springnuts: AFIK I have not previously edited this article, nor have I interacted with either of the editors in this disagreement.

I note that both of you have put considerable effort into, and are committed to, improving the encyclopedia - thank you! However, Wikipedia is not a textbook, so your work has, I am afraid, been misplaced. Sorry, but there it is. The reason is that this whole section falls short of the policy at WP:TECHNICAL. It's far too detailed for the average reader. The rule of thumb is here: WP:ONEDOWN. With all respect, your efforts, laudable as they are, belong somewhere else - perhaps a blog or forum.

My 3O then, for what it is worth, is that one or other of you - or a third party - reduces the section here: Binary_search_tree#Operations to no more than four paragraphs, briefly covering: introduction; lookup, insertion and deletion of an element. Get rid of all the notes, then whilst you are about it simplify this section: Binary_search_tree#Examples_of_applications. Finally, ensure that this section: Binary_search_tree#Further_reading has some good pointers in it - five or six should be plenty - so that those who wish to study the topic in the detail and at the level you clearly both possess can do so.

This is my 3O. I hope you will accept it, but you are free to disagree of course.

With my best wishes to you both, Springnuts (talk) 16:56, 21 August 2021 (UTC)

Source Addition

There's this helpful site called visualgo.net that includes helpful demonstrations and interactive examples of computer science concepts, including the binary search tree. Could someone please add this as a source? ScientistBuilder (talk) 21:45, 13 October 2021 (UTC)ScientistBuilderScientistBuilder (talk) 21:45, 13 October 2021 (UTC)

Added the site as one of the external links in this revision diff. add this as a source, book by Steven Halim passes WP:RS/SPS and the media can be used on Wikipedia since the site effectively states CC-BY on its ToS. WikiLinuz (talk) 22:30, 13 October 2021 (UTC)
That site was aggressively spammed a few years ago and duplicates material we already have. I took it back out. - MrOllie (talk) 22:33, 13 October 2021 (UTC)
aggressively spammed? Could you link me to that? I don't know about that event. WikiLinuz (talk) 22:36, 13 October 2021 (UTC)
An IP added it to a couple dozen articles, I don't have anything specific to link to about it. - MrOllie (talk) 22:40, 13 October 2021 (UTC)
To mention, there is also a notable site hosted by Stanford University department which we use on BST visualization as an external link on few articles. Given this is written by an academic, I seriously doubt that it's aggressively spammed. WikiLinuz (talk) 22:42, 13 October 2021 (UTC)
People spam links for all sorts of reasons. Ego is as powerful a motive as profit. But at any rate we already have a link that provides the same sort of content. - MrOllie (talk) 22:44, 13 October 2021 (UTC)
There's a difference between spamming and linking to a resource hosted by an academic or a university's department on articles. In the later case, a link added of good faith, effectively passes WP:ELNO #11 for the reasons mentioned. It's only WP:LINKSTOAVOID if there it's some promotional website which is trying to attract traffic or outright irrelevant. Also, if we already have a link that provides the same sort of content, we give WP:DUE to the best one, which should be ranked objectively. WikiLinuz (talk) 22:54, 13 October 2021 (UTC)
I'm not saying you're spamming it, but when a link is previously spammed, and we already have another link that is much the same thing, it is a factor in which one we should keep. We really don't need duplicates. MrOllie (talk) 23:08, 13 October 2021 (UTC)
1 is clearly better than currently existing 2 if we visit and use it. Given that, I'm inclined towards replacing it with the better one if it seems like duplicates. WikiLinuz (talk) 23:13, 13 October 2021 (UTC)
@MrOllie: I've already objectively mentioned why that link should be added on my previous comments. If you WP:JUSTDONTLIKEIT, explain me here. Do not play revert wars. You don't seem to support your claims of the link being previous spammed through evidence. Prove me wrong if you wanted to keep the previous link, if you're not gonna do that, I'll revert this diff. WikiLinuz (talk) 09:24, 14 October 2021 (UTC)
Your argument, conversely, is just ILIKEIT. Other people frequent this talk page, at this point I think it is best to maintain the status quo ante bellum until one of them chimes in. Accusing me of playing revert wars while simultaneously pledging to revert war yourself is rather inconsistent, you might want to think about it. - MrOllie (talk) 11:27, 14 October 2021 (UTC)

GA Review

GA toolbox
Reviewing
This review is transcluded from Talk:Binary search tree/GA3. The edit link for this section can be used to add comments to the review.

Reviewer: Mhawk10 (talk · contribs) 05:16, 14 May 2022 (UTC)


Hello! I'll take a look at this article and give feedback over the next couple of days. — Ⓜ️hawk10 (talk) 05:16, 14 May 2022 (UTC)

@Mhawk10: Thanks for taking this one. If there are any copy edits, improvements or changes you want to be made, please let me know. I'll make the revisions ASAP. --WikiLinuz {talk} 🍁 12:44, 14 May 2022 (UTC)
@WikiLinuz: I've placed the article on-hold, per below. I'm still working through and spot-checking refs, though there are going to need to be some improvements made if this is going to become a GA. — Ⓜ️hawk10 (talk) 18:30, 16 May 2022 (UTC)
@Mhawk10: Thanks. Keep them posted, I'll incrementally make those requested changes within the standard seven days on-hold period. --WikiLinuz {talk} 🍁 18:33, 16 May 2022 (UTC)
Rate Attribute Review Comment
1. Well-written:
1a. the prose is clear, concise, and understandable to an appropriately broad audience; spelling and grammar are correct.

No spelling or grammar errors that I can detect on another read through, aside from the issue I'm raising in the area on original research. Once that's fine, this should be good to go from a prose quality perspective. — Ⓜ️hawk10 (talk) 04:51, 14 June 2022 (UTC)

Resolved. — Ⓜ️hawk10 (talk) 05:48, 14 June 2022 (UTC)
1b. it complies with the Manual of Style guidelines for lead sections, layout, words to watch, fiction, and list incorporation. There are issues with compliance with MOS:LEAD. The lead does not include any materials from the "Examples of Applications", "Types", and "History" sections, while it probably should. The length of the lead was something that was noted in Talk:Binary search tree/GA1 but has not been fixed. This technically would be enough for a quick fail, though it's often best to re-write the lead after all of the other fixes are made so I think it's best to WP:IAR and put this on hold rather than give a quick fail. — Ⓜ️hawk10 (talk) 02:53, 16 May 2022 (UTC)
Again, still no mention of the history in the lead. Why? — Ⓜ️hawk10 (talk) 04:51, 14 June 2022 (UTC)
Resolved. — Ⓜ️hawk10 (talk) 05:48, 14 June 2022 (UTC)
2. Verifiable with no original research:
2a. it contains a list of all references (sources of information), presented in accordance with the layout style guideline. There indeed is a references section that is MOS-compliant. — Ⓜ️hawk10 (talk) 18:32, 16 May 2022 (UTC)
2b. reliable sources are cited inline. All content that could reasonably be challenged, except for plot summaries and that which summarizes cited content elsewhere in the article, must be cited no later than the end of the paragraph (or line if the content is not in prose). All of the citations that are in the document are reliable sources. — Ⓜ️hawk10 (talk) 00:01, 24 May 2022 (UTC)
2c. it contains no original research. The second edition of the MIT textbook that is cited for the Tree-Predecessor pseudocode is left as an exercise to the reader (Exercise 12.2-3) in the cited textbook. While the text notes that "The procedure TREE-PREDECESSOR, which is symmetric to TREE-SUCCESSOR", the citation is a bit weak to support the specific pseudocode in the article. — Ⓜ️hawk10 (talk) 01:51, 16 May 2022 (UTC)
Also, can you show that the "tree-deletion" pseudocode operates the same as the "TREE-DELETE" pseudocode in the cited source? If so, it's fine as a routine calculation, but this is something that you are going to need to demonstrate here. — Ⓜ️hawk10 (talk) 01:51, 16 May 2022 (UTC)
Binary search trees support three main operations: lookup (checking whether a key is present), insertion, and deletion of an element. The latter two possibly change the structural arrangement of the nodes in the tree, whereas the first one is a navigating and read-only operation. Other read-only operations are traversal, verification, etc. needs a citation. The end of that sentence also probably could be improved flow-wise. — Ⓜ️hawk10 (talk) 00:01, 24 May 2022 (UTC)
Again, this still should have a citation and should still be rephrased. — Ⓜ️hawk10 (talk) 04:51, 14 June 2022 (UTC)
This has been made moot by the removal of the material. — Ⓜ️hawk10 (talk) 05:48, 14 June 2022 (UTC)
2d. it contains no copyright violations or plagiarism. I've acquired a copy of Introduction to Algorithms, Second Edition. The cited pages of the book appear to give pseudocode that contains the same function names as are in the book, though the pseudocode itself is transformed so as to not be a verbatim copy of what's in the book. The book was published in the United States, so the copyrights are exclusively governed by U.S. law. Copyrights in the United States are not valid when there are a very limited set of ways in which an idea can be expressed, so the pseudocode for those algorithms per se is not eligible under copyright protection. However, the choice to use "Tree-Search" for the name of the recursive search function and "Iterative-Tree-Search" for the iterative search function alongside the use of "Tree-Successor", "Tree-Maximum", "Tree-Minimum", "Tree-Insert", "Tree-Delete", and " probably extends beyond this limited exception to copyright—it's certainly possible to give the functions different names than are given in the MIT textbook. — Ⓜ️hawk10 (talk) 01:51, 16 May 2022 (UTC)
This issue has been remediated. — Ⓜ️hawk10 (talk) 05:48, 14 June 2022 (UTC)

If you'd like to take action against a source that copied Wikipedia without attribution, this medium post showed 67% similarity to this article on WP:EARWIG. This is a case of a publication copying Wikipedia, so it does not pose an issue for the article's promotion to GA. — Ⓜ️hawk10 (talk) 02:05, 16 May 2022 (UTC)

3. Broad in its coverage:
3a. it addresses the main aspects of the topic. There is a lot written about self-balancing binary search trees in the academic literature, which appears to be a child topic of this article. The current article addresses this topic within the "types" section, but it doesn't really go in-depth into it. It also isn't quite structured like the typical parent-child article relation (for example, with the {{main article}} template as a header of a section or sub-section). — Ⓜ️hawk10 (talk) 02:14, 16 May 2022 (UTC)
Similarly, the history section is really short. It might be worthwhile to briefly describe the history of the major variants of the binary search tree as well; Red-Black Trees, AVL Trees, etc. are worth prominently mentioning in this article and might be helpful in expanding the history section beyond a sentence. — Ⓜ️hawk10 (talk) 02:44, 16 May 2022 (UTC)
I like the way that you handled making this more like a summary style article and I think it more appropriately balances these sorts of things. — Ⓜ️hawk10 (talk) 04:51, 14 June 2022 (UTC)
3b. it stays focused on the topic without going into unnecessary detail (see summary style). The article seems to have no problems here. — Ⓜ️hawk10 (talk) 04:51, 14 June 2022 (UTC)
4. Neutral: it represents viewpoints fairly and without editorial bias, giving due weight to each. Looks fine as of now. — Ⓜ️hawk10 (talk) 02:34, 16 May 2022 (UTC)
5. Stable: it does not change significantly from day to day because of an ongoing edit war or content dispute. I don't see any edit warring recently. — Ⓜ️hawk10 (talk) 02:35, 16 May 2022 (UTC)
6. Illustrated, if possible, by media such as images, video, or audio:
6a. media are tagged with their copyright statuses, and valid non-free use rationales are provided for non-free content. The images used in the article are tagged with their copyright status. — Ⓜ️hawk10 (talk) 18:30, 16 May 2022 (UTC)
6b. media are relevant to the topic, and have suitable captions. Images pertain to the material and have policy-compliant captions. — Ⓜ️hawk10 (talk) 18:30, 16 May 2022 (UTC)
7. Overall assessment. On hold for now. — Ⓜ️hawk10 (talk) 18:30, 16 May 2022 (UTC)
Passed! — Ⓜ️hawk10 (talk) 05:48, 14 June 2022 (UTC)
@Mhawk10:
  • 1b - I've copy-edited the lead to include information from other sections.
  • 2c - I've added additional references for the predecessor pseudocode. The "BST-Delete" is nearly identical to that of the sourced material, and the only variant is the internal call to "TRANSPLANT", which is "Shift-Nodes" in the article.
  • 2d - I've modified the subroutine names.
  • 3a - I've rewritten the history section to include self-balancing aspects, and also copy-edited the "types" section.
--WikiLinuz {talk} 🍁 04:13, 20 May 2022 (UTC)
@WikiLinuz: thank you for the ping! I'll take another look through and give more feedback when I get a chance. — Ⓜ️hawk10 (talk) 04:24, 20 May 2022 (UTC)

A drive-by comment (re GACR 3a or maybe 4): The coverage of optimal binary search trees is currently totally inadequate. It is ungrammatical (the first noun phrase of the first sentence is missing its article). It fails to properly describe the problem (optimal in this context means in terms of average time with respect to some distribution or sequence of updates, not worst case time). It is misclassified under "self-balancing" (much of the work in this area is on static algorithms for constructing these trees, not on self-balancing trees). It fails to mention the time bounds for these static problems, or even the basic fact that these trees can be constructed in polynomial time. It fails to mention the connection to online algorithms and competitive ratios via the dynamic optimality conjecture for splay trees and greedy-ass trees and tango trees. If this is representative of the whole article I can see why this is on its third review after two previous contentious reviews — this is a level of unreadiness for GA that cosmetic edits alone won't fix. —David Eppstein (talk) 18:38, 22 May 2022 (UTC)

I've taken a note of your comment on the optimal BST. But I don't think I can access Wikipedia for a day or two since I'm facing power outage for 2 days due to a major storm in Toronto area. I'm not sure when the power will be back.

https://www.bbc.com/news/world-us-canada-61541653.amp WikiLinuz-mobile (talk) 21:35, 22 May 2022 (UTC)

@WikiLinuz-mobile: Stay safe! I can keep this on hold for as long as need be to make the changes. — Ⓜ️hawk10 (talk) 21:43, 22 May 2022 (UTC)
@Mhawk10: Thank you. Power is back in my neighborhood, I'll be working on the mentioned remarks starting today. --WikiLinuz {talk} 🍁 09:21, 25 May 2022 (UTC)
@Mhawk10: I've made substantial revisions to the particular section in question, shortened the body, and removed UNDUE text. As a result, I've decided to confine the article to BST. Please take a look at the current revision and let me know if you like some changes. --WikiLinuz {talk} 🍁 05:10, 6 June 2022 (UTC)
I will take a look through over the next couple of days. — Ⓜ️hawk10 (talk) 05:38, 7 June 2022 (UTC)
@Mhawk10: I received a notice from Legobot on the 8th saying that the nomination would automatically fail in 7 days. It's been five days (June 13th), so it'd be great if you could look through and note any changes before auto-fail. Thanks. --WikiLinuz {talk} 🍁 23:25, 13 June 2022 (UTC)
Hi! I'll get to that tonight. I promise it won't auto-fail you; the only way that it would fail is if I (or another reviewer) were to fail it. — Ⓜ️hawk10 (talk) 23:26, 13 June 2022 (UTC)
@WikiLinuz: I've updated the table above. I'm still not seeing any mention of the history section in the lead, which for me constitutes an MOS:LEAD violation. Please remediate this and the other issues that remain. — Ⓜ️hawk10 (talk) 04:51, 14 June 2022 (UTC)
@Mhawk10:
  • 2c: That paragraph merely states the operations within the sub-section. But I think the operations themselves are self-explanatory and don't need a secondary introduction, so I've taken them away.
  • 1b: I've copy-edited to include things from the history section in the lead (regarding attribution and invention of the self-balancing variants to address a critical issue that BST suffers from). Please let me know if you'd like something else to be summarized in the lead.
--WikiLinuz {talk} 🍁 05:44, 14 June 2022 (UTC)
Passed! Congrats on the GA. — Ⓜ️hawk10 (talk) 05:48, 14 June 2022 (UTC)

A Commons file used on this page or its Wikidata item has been nominated for deletion

The following Wikimedia Commons file used on this page or its Wikidata item has been nominated for deletion:

Participate in the deletion discussion at the nomination page. —Community Tech bot (talk) 16:52, 22 December 2022 (UTC)

Retrieved from "https://wiki.riteme.site/w/index.php?title=Talk:Binary_search_tree/Archive_2&oldid=1213889697"