文件名称:AVL-tree
介绍说明--下载内容均来自于网络,请自行研究使用
1、以文本的形式输入平衡二叉树的数据,第一行为结点的个数,第二行为结点的值。并构造平衡二叉树
2、以文本的形式输出平衡二叉树的先序遍历,同一行中的两个数字之间用空白字符相隔。-1, in the form of text input balanced binary tree data, the number of the first acts of nodes, the value of the second node behavior. And constructs a balanced binary tree
2, in the form of text output balanced binary tree preorder traversal, separated by white space between the two numbers in the same row.
2、以文本的形式输出平衡二叉树的先序遍历,同一行中的两个数字之间用空白字符相隔。-1, in the form of text input balanced binary tree data, the number of the first acts of nodes, the value of the second node behavior. And constructs a balanced binary tree
2, in the form of text output balanced binary tree preorder traversal, separated by white space between the two numbers in the same row.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
平衡二叉树.cpp