Threaded Binary Tree (TBT) IN Data Structure Explaination
Threaded binary tree. It is known as TBT. All null pointers in binary tree are utilized to store the address of ancestor node which can be inorder predecessor or inorder successor.
Comments
Related Posts
Tree applications
L-3.12: Deletion in Heap tree | Time complexity
1.5 Introduction to Two Dimensional (2D) arrays | Implementation of 2D arrays |Memory representation
Threaded Binary Tree (TBT) IN Data Structure Explaination
Difference between stack and queue | what is stack and queue | Data structure
