Threaded binary search tree implementation

-*+What are threaded binary search tree? Threaded binary search tree is BST in which all right pointers of node which point to NULL are changed and made to point to inorder successor current node (These are called as single threaded trees). In completely threaded tree (or double threaded trees), left pointer of node which points … Continue reading Threaded binary search tree implementation