Description: Binary Sort Tree creation and use of
(Time limit: 1000 ms)
Description:
Binary sort tree is defined as: either an empty tree, or the nature of the binary tree with the following: (1) if its left subtree is not empty, then the left sub-tree of all nodes were less than the value of its root node (2) if it s the right subtree is not empty, then the right sub-tree of all nodes are greater than or equal to the value of its root node (3) around its sub- tree were binary sort tree. Are required elements of the input value, a binary sort tree structure, and the output of its first order traversal, inorder traversal and postorder traversal results.
Input:
Enter the number of the first acts of the test case n, then for the n test cases, accounting for two lines of each test case, where the first acts of the number of elements m, m a need to construct the second act into a binary sort tree of element values .
Output:
With three lines of output for each test case, wh
To Search:
- [4.doc.cdoc] - C language program---- binary sort tree
File list (Check if you may need any files):
二叉排序树的创建与使用.cpp
Download