Question

What is threaded binary tree in data structure?

Answer 1

A binary tree is threaded by making all right child pointers that would normally be null point to the inorder successor of the node (if it exists) it is called single threaded, and all left child pointers that would normally be null point to inorder predecessor of the node, it is called double threaded.