The realization of the balanced binary sort tree problem description: from the start to create a hollow tree, in the process of creating, guarantee the order of the tree, but also make some change for the balance of a tree, eventually want to create a good balance binary sort tree into a binary sort tree, basic requirements: 1, using binary linked list storage structure, to enter (' \ n ') as the input end of the sign, the input sequence of L, generated a balanced binary sort tree T, and on the terminal in a visual display; 2, T to the binary sort tree in the sequence traversal, the output; 3, input element x, find the binary sort tree T, if there is including node of x, the nodes are removed, and the sequence traversal (performed on 2); Otherwise output "x", and insert the x the binary sort tree, note: insert, delete should guarantee the balance of a binary sort tree,