data structures using traversing threaded binary tree for every nodevisit the left sub-tree firstprovided if one exists and has not been visited earlier then the node (rootitself is followed by visiting its right sub-tree (if one existsin case there is no right sub-treecheck for the threaded link and make the threaded node the current node in consideration the algorithm for in-order traversal of threaded binary tree is given in fig step check if the current node has left child that has not been visited if left child exists that has not been visitedgo to step else go to step step add the left child in the list of visited nodes make it as the current node and then go to step step if the current node has right childgo to step else go to step step make that right child as current node and go to step step print the node and if there is threaded node make it the current node step if all the nodes have visited then end else go to step figure algorithm for in-order traversal of threaded binary tree let' consider the threaded binary tree given in fig and traverse it using the algorithm node has left child which has not been visited soadd in the list of visited nodesmake it as the current node node has left child which has not been visited soadd in the list of visited nodesmake it as the current node figure threaded node does not have any left or right childso print and check for binary tree its threaded link it has threaded link to node so make node the current node node has left child which has already been visited howeverit does not have right child nowprint and follow its threaded link to node make node the current node node has left child that has been already visited so print node has right child which has not yet been visitedso make it the current node node has left child (node which has not been visitedso make it the current node node does not have any left or right child so print howeverit does have threaded link which points to node make node the current node node has left child which has already been visited so print now there are no nodes leftso we end here the sequence of nodes printed is-- advantages of threaded binary tree it enables linear traversal of elements in the tree linear traversal eliminates the use of stacks which in turn consume lot of memory space and computer time it enables to find the parent of given element without explicit use of parent pointers since nodes contain pointers to in-order predecessor and successorthe threaded tree enables forward and backward traversal of the nodes as given by in-order fashion thuswe see the basic difference between binary tree and threaded binary tree is that in binary trees node stores null pointer if it has no child and so there is no way to traverse back