In many cases, it has been realized that in a binary search tree, many nodes have an empty left child or empty right child or both. Threaded Binary tree is an attempt to utilize these fields in such a way so that the empty left child of a node points to its inorder predecessor and empty right child of the node points to its inorder successor.
One way threading:– In this tree, the right NULL field uses thread (link) which will point to the next node in the inorder traversal.
Two way threading:- In this tree, both NULL fields uses threads (links) in which left thread will point to the preceding node in the inorder traversal and the right thread will point to the next node in the inorder traversal.
Lets develop good understanding of the basic of Threaded Binary Tree. [Click the following links to watch the video]
- Threaded Binary Tree – Fundamentals
- Adding Node in Threaded Binary Tree
- Deleting a Node in Threaded Binary Tree
You are invited to raise queries by writing your question in the box given below
Expertvision 