说明：  输入n个两两互不相等的整数，以这些整数为关键字建立平衡的二叉排序树。 判断该二叉树是否为平衡的，输出判断结果；输出该二叉树的中序遍历关键字访问次序。
(Enter an integer n pairwise distinct and so on, in order to establish a balance of these integer binary sort tree as a keyword. Determine whether the binary tree is balanced, the judgment result output output of the binary tree traversal key access order.)