Question: Since a binary search tree with N nodes has N + 1 null references, half the space allocated in a binary search tree for link
Since a binary search tree with N nodes has N + 1 null references, half the space allocated in a binary search tree for link information is wasted. Suppose that if a node has a null left child, we make its left child link to its inorder predecessor, and if a node has a null right child, we make its right child link to its inorder successor. This is known as a threaded tree, and the extra links are called threads.
a. How can we distinguish threads from real children links?
b. Write routines to perform insertion and deletion into a tree threaded in the manner described above.
c. What is the advantage of using threaded trees?
Step by Step Solution
3.28 Rating (174 Votes )
There are 3 Steps involved in it
a You need an extra bit for each ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
1486-C-S-A(350).docx
120 KBs Word File
