Description: Binary search tree, binary search tree to find a similar process and sub-optimal binary tree, usually linked to the binary search tree as a binary storage structure. Inorder traversal of a binary search tree obtained an ordered sequence of keywords, one can construct a sequence of random binary search tree into an ordered sequence, the process of the tree structure is the sort of random sequences process. Each time a new node into the binary search tree is a new leaf node, during the insertion operation, without moving the other nodes, just the pointer changes to a node from the air into a non-empty be. Search, insert, delete, equal to the complexity of tree height.
To Search:
File list (Check if you may need any files):
050\50.C
050
Download