Threaded binary tree

Question

Define the term threaded binary tree. Describe its common uses.

Answer 1

The threaded binary tree is structured in order that, all the right child pointers would generally be null and points to the ‘in-order successor’ of the node. Likewise, all the left child pointers would generally be null and points to the ‘in-order predecessor’ of node.

The uses of Threaded binary tree are as:

a) Traversal is quicker than the unthreaded binary trees.

b) More subtle, by allowing the determination of predecessor and successor nodes which begins from any node, in a proficient way.

c) No stack overload can be taken out with threads.

d) Accessibility of any node from the other node.

e) It is easy to implement the insertion and deletion from a threaded tree.