P>What I need is an algorithm that I can use to delete a node from a fully threaded binary tree. Is there any cool repository of popular algorithms that I might look? I've found plenty of info for ...

The algorithm functions as follows ... which can reduce its overall efficiency. Binary Search Trees (BSTs): A BST is a tree-like data structure in which each node can have a maximum of two ...

Binary tree is one of the most important data structures in the programming world. The basic definition can be given as follows (as mentioned in one of the data structures book by Tenenbaum).