Threaded binary tree and its common uses

Question

Explain about the threaded binary tree and its common uses.

Answer 1

A threaded binary tree is structured sequentially 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 usually be null and points to the ‘in-order predecessor’ of the node.

Utilizes of Threaded binary tree:

- Traversal is quicker than unthreaded binary trees

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

- No stack overload can be carried out along with the threads.

- Ease of use of any node from some other node

- This is easy to implement to deletion and insertion from a threaded tree.