（1）建立包含10个结点的分类二叉树（树结构和数据元素的值由自己设定）；建立包含10个结点序列的堆（数据元素的值由自己设定）；（2）完成分类二叉树中序遍历和堆排序程序；

（3）给出程序和遍历、排序程序的结果。

-(1) contains 10 nodes to establish the classification of binary tree (the tree structure and data element values from their set)　the establishment of 10 nodes containing sequences of the heap (data element values from the set itself)　(2 ) complete the classification of binary tree traversing and heap sort procedure　(3) gives the procedures and traversal, sorting proceedings.