Threaded binary tree

Question

Briefly describe the term threaded binary tree. Elucidate its common uses?

Answer 1

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

Employs of Threaded binary tree:

- Traversal is faster than the unthreaded binary trees

- More subtle, by enabling determination of predecessor and successor nodes which starts from any node, in an efficient way.

- No stack overload can be carried out with threads.

- Convenience of any node from any other node

- It is easy to apply to insertion and deletion from a threaded tree.