输入一组关键字序列，并以此顺序建立一棵平衡二叉树（提示：为简化运算，可采用含有左、右子树高度和指向父母的指针的三叉链表表示），并在建树过程中用逆中序法输出每次插入新结点后的平衡二叉树形状。-Enter a list of keywords sequence, and thus the order of the establishment of a balanced binary tree (Hint: To simplify the computation, can contain the left and right subtree height and point to the trigeminal target parents express list), and contribution to the process of using the inverse method in order to insert the output of each new node after the balanced binary tree shape.