Talk:Binary search tree/GA2

GA Review

{{GA|17:38, 8 April 2022 (UTC)|topic=|page=} Reviewer: Ewdqwdq (talk · contribs) 17:38, 8 April 2022 (UTC)

@Ewdqwdq: Thanks for taking this, if there are any improvements that you want to be made, please list them out. I will copy edit and make those changes ASAP. Regards, WikiLinuz {talk} 🍁 17:42, 8 April 2022 (UTC)

Who is Ewdqwda?

Hello Ewdqwdq. Who are you? Your username resembles a password, and your account is only 12 days old. Please confirm you're not a sockpuppet. Timhowardriley (talk) 21:15, 8 April 2022 (UTC)

That account is my alt. Is that okay?? Eluike (talk) 21:42, 8 April 2022 (UTC)

Simplify to a broader audience

I'm very interested in this article. I would like to understand it enough to incorporate binary search trees (BST) into my code library. However, even though I was exposed to BSTs in two courses (Graph Theory and Data Structures), this article is over my head. It's probably technically correct, but it needs to be heavily expanded. For example, I referred back to my Data Structures textbook to realize that BSTs are an extension of binary trees. Well, the first paragraph after the lead should be an explanation of binary trees and how this article extends them. However, it shouldn't read like binary tree because I can't understand that either. Instead, it should fully define in as simple of terms as possible all the jargon. This is not an easy task. This wikipedia article explains the goal: Wikipedia:Make technical articles understandable. I learned from a published author (http://www.jimchurchphoto.com/JimBio.html) to write at the 8th grade level. I'm also motivated by "Up Goer Five". It's an attempt to explain rocket science at the Elementary school level. See https://www.explainxkcd.com/wiki/index.php/1133:_Up_Goer_Five . Nonetheless, I wish the editors of this article good reviews. Timhowardriley (talk) 22:13, 8 April 2022 (UTC)

@Timhowardriley: I will copy-edit it. WikiLinuz {talk} 🍁 22:23, 8 April 2022 (UTC)