Threaded Binary Tree (TBT) IN Data Structure Explaination

Vivekanand Khyade - Algorithm Every Day
Youtube
Related Topic
:- Data Structures

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. 

ORIGINAL Video

Comments

Related Posts

your image

Array 1: Basics of Array | Data Structures | Lec 2 | GATE CSE/IT 2021 Exam

Youtube
your image

*Best* Trick To Find PreOrder, InOrder & PostOrder Traversal

Youtube
your image

Introduction to AVL tree (Why AVL tree is needed?)

Youtube
your image

Best Case, Worst Case and Average Case Analysis of an Algorithm (With Notes)

Youtube
your image

Selection Sort | GeeksforGeeks

Youtube