Ask
Login
0
3.3kviews
Explain threaded Binary tree
written 5.9 years ago by gravatar for kaivanshah kaivanshah • 260 modified 4.3 years ago by gravatar for prashantsaini prashantsaini • 0
data structures and algorithms
ADD COMMENT EDIT
1 Answer
0
55views
written 5.9 years ago by gravatar for kaivanshah kaivanshah • 260 •   modified 5.9 years ago

  1. In a linked list representation of binary trees, there are more null links than the node links. Such null links are replaced by pointers called as threads, such a tree is called as Threaded Binary Tree.

  2. A left null link of a node is replaced with the address of its in-order predecessor.

  3. A right null link of a node is replaced with the address of its in-order successor.

  4. Example

enter image description here

  1. There are two types of Threaded Binary Trees:-

    a. Single Threaded: each node is threaded towards either(right)' the in-order predecessor or' successor.

    b. Double threaded: each node is threaded towards both(left & right)' the in-order predecessor and' successor.
ADD COMMENT EDIT
Please log in to add an answer.