（1）输入字符序列，建立二叉链表。

（2）遍历二叉树输出。

（3）请设计一个算法，要求该算法把二叉树的叶子结点按从左到右的顺序连成一个单链表，表头指针为head。 二叉树按二叉链表方式存储，链接时用叶子结点的右指针域来存放单链表指针。请遍历该链表输出所有叶子结点，然后再先序遍历二叉树输出所有叶子结点，并对比两个输出结果，看是否相同。

（4）试写一算法判断某二叉树是否是完全二叉树。

（5）试写一算法判断某二叉树是否是二叉排序树。

（6）在主函数中设计一个简单的菜单，分别调试上述算法。

-(1) Enter the sequence of characters, build binary list. (2) binary tree traversal output. (3) design an algorithm, the algorithm requires the leaf nodes of a binary tree from left to right together into a single list, table pointer for the head. Binary stored by binary list, to store a single list pointer pointer field with the right leaf node link. Please traverse the list to output all the leaf nodes, and then output the first tree traversal of all leaf nodes, and compare the results of two outputs, to see whether the same. (4) Try to write an algorithm to determine whether a binary tree is a complete binary tree. (5) Try to write an algorithm to determine whether a binary tree is a binary sort tree. (6) Design a simple menu in the main function, namely to debug these algorithms.