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
Insertion sort in 2 minutes
6.1 Graph representation in Data Structure(Graph Theory)|Adjacency Matrix and Adjacency List
Introduction to Stack in Data Structures
Lowest common ancestor of two nodes in Binary Tree Algorithm
Why Floyd's cycle detection algorithm works? Detecting loop in a linked list.
