Since a binary search tree with N nodes has N + 1 null references, half the
Chapter 4, Problem 4.50(choose chapter or problem)
Since a binary search tree with N nodes has N + 1 null references, half the spaceallocated in a binary search tree for link information is wasted. Suppose that if anode has a null left child, we make its left child link to its inorder predecessor, andif 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 themanner described above.c. What is the advantage of using threaded trees?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer