Description: two forks in search of a tree to delete two children nodes, can be used in three ways : (1) to use the left subtree TL on key codes with the greatest of nodes replace X, then X- recursive deleted. (2) to use the turn of the left subtree TL on key codes with the greatest of nodes and right subtrees TR is the smallest key codes node replacement and then recursively to delete the appropriate nodes. (3) The left subtree TL on key codes with the greatest of nodes or use the right subtrees TR is the smallest on the key code top node for further recursion to delete the appropriate nodes. Which can be a random selection program.
To Search:
File list (Check if you may need any files):
Download