Threaded binary tree

 Posted on January 25, 2010  (Last modified on August 7, 2020)  |  2 minutes  |  Kinshuk Chandra

Since traversing the three is the most frequent operation, a method must be devised to improve the speed. In case of iterative traversal, speed is less than recursive one. So we cans use Threaded tree. If the right link of a node in a tree is NULL, it can be replaced by the address of its inorder successor. This tree is called right in-threaded binary tree. An extra field called the rthread is used. [Read More]
inorder  tree  Algorithms  kodeknight  inorder successor  Inorder traversal  binary-search-tree  BST  Threaded binary Tree