Binary Search Tree

[cerulean linden]

When your question is answered use !solved to mark the question as resolved.

Remember to ask specific questions, provide necessary details, and reduce your question to its simplest form. For tips on how to ask a good question use !howto ask.

[cold brook]

!howto ask

[cerulean linden]

How to Ask a Programming Question

Anyone can ask a question in our programming channels. Following the guide Writing The Perfect Question is recommended.

What to Post

State your problem clearly and provide all necessary details:

• the relevant portion of your code, or all of it
• the expected output
• the actual output (or the full error)
  :trophy: Gold Standard: Minimal Reproducible Example

Where to Post

Provide the relevant code in the message, and format it nicely with a code block*. If it's too much for one message, you can upload it:

• Compiler Explorer for most C and C++ snippets
• OnlineGDB for interaction, debugging
  :no_entry: Do not post screenshots, let alone photos of your screen!

* Use /code if you don't know how to format code blocks

[queen juniper]

!google BST delete algorithm

[cerulean linden]

Google

BST delete algorithm

[queen juniper]

The first results explain the idea pretty clearly

https://www.javatpoint.com/deletion-in-binary-search-tree

You have three cases based on how many children you have

Your children may have children, so you must recurse and repeat the logic

The geeks4geeks code is decent https://www.geeksforgeeks.org/deletion-in-binary-search-tree/

[cerulean linden]

@light crater

Please Do Not Delete Posts!

Please don't delete forum posts. They can be helpful to refer to later and other members can learn from them. In the future you can use !solved to close a post and mark a post as solved.