Define Threaded Binary tree.
Answers
Answered by
0
In computing, a threaded binary tree is a binary tree variant that facilitates traversal in a particular order.
An entire binary sort tree can be easily traversed in order of the main key, but given only a pointer to a node, finding the node which comes next may be slow or impossible.
thanks
An entire binary sort tree can be easily traversed in order of the main key, but given only a pointer to a node, finding the node which comes next may be slow or impossible.
thanks
Similar questions