Is there any algorithm to insert,delete in a binary tree?

Question

I know about BST ,but I just want to know whether we can insert ,delete in Binary tree

Answer 1

abishek sriram
Insertion begins by examining the root, left, right elements of the subtree, We examine the root and recursively insert the new node to the left subtree if its key is less than that of the root, or the right subtree if its key is greater than the root. If the key exists, we can either replace the value by the new value or just return without doing anything.

Deletion is more complex as we need to delete the value by key so for that first we have to find node by given key and then removal of the node is possible.
1) if the node which we want to delete is in leaf then we can simply remove them.
2) Deleting a node with one child: remove the node and replace it with its child.
3) Deleting a node with two children: we first find its in-order successor (left-most node in its right sub-tree), let's say A. Then copy A's key and value to the node, and remove A from its right sub-tree.

These way this two operation are performed on the binary search tree.

Answer 2

abishek sriram
"I'm looking for cpp"
If you look for and wanted to focus on answers implementable in C++ then you need to add 'C++' in Relevant Tags of your question. That way the focus of the question is clear.

Good luck! 👍

Answer 3

My proposal:

https://code.sololearn.com/clAL7BHwjBCd/?ref=app

Answer 4

What do you exactly mean? Is it the mathematical explanation of Heron‘s method for cube roots or are you looking for methods in a specific programming language?

Answer 5

A BST algorithm is usually recursive, depending on the condition for the current value (greater or lower) the algorithm is recalled with a refering keyword „left“ or „right“.

Answer 6

Ipang
Sorry I'm using this app from last month so I'm not familiar with most of the things . thank you ! Here after I will make it more precise

Answer 7

abishek sriram
Thanks for understanding bro! 👍

Answer 8

Michael
No I just asking how can we insert in a binary tree .In BST we can insert the element in left if it is smaller and right if it is greater(I mean it will be automatically inserted according to the value) .so like that is there any way to insert in a binary tree

Answer 9

Or we have to manually enter position left or right for every node?

Answer 10

Michael

I'm looking for cpp