Explain insertion operation on Binary tree?
Answers
Answered by
1
When inserting or searching for an element in a binary search tree, the key of each visited node has to be compared with the key of the element to be inserted or found.
The shape of the binary search treedepends entirely on the order of insertions and deletions, and can become degenerate.
by ....
dark⚫️
The shape of the binary search treedepends entirely on the order of insertions and deletions, and can become degenerate.
by ....
dark⚫️
Similar questions