Deletion in binary search tree
Explain how deletion is performed in the binary search tree.
Expert
The three processes are described below:
a) If the node is a leaf, then it can be deleted instantly.
b) If the node consists of one child then the node can be deleted after its parent adjusts a pointer to bypass node.
c) If the node consists of two children the general strategy is to substitute the data of this node with the smallest data of the right sub tree and recursively delete the node that is empty.
Name the data structures which are used to perform the recursion?
Write down a brief note on the term Huffman algorithm?
Briefly describe the term queue operation?
Is it possible to insert the various types of elements in a stack? Explain how?
List out the merits and demerits of the term rehashing?
What is meant by the data design?
What is minimum number of queues required to implementing the priority queue?
Write down the major data structures employed in the following areas: RDBMS, Network data model and Hierarchical data model?
What are the uses of binary tree?
Briefly describe the term priority queues?
18,76,764
1925999 Asked
3,689
Active Tutors
1432437
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!