二叉树的顺序存储结构——已知用户将一棵完全二叉树的n个结点（数据类

型可以是字符型、整型等等）以自顶向下、从左到右顺序输

入到一个一维数组中：

（１）编写算法ＦｉｎｄＲｅｌａｔｉｏｎ（ｉ），输出ｉ的父结点和

所有孩子结点（如果有的话）。（２）编写算法Print打印这棵二叉树的所有节点：先打印二叉树的

根、再打印左子树、最后打印右子树；（即在顺序存储结构上先序遍历

二叉树）；

-Stored in the order of the binary tree structure- known to users will be a complete binary tree of n nodes (data type can be character, integer, etc.) to a top-down, left to right order of the input to a one-dimensional array in: (1) to write the algorithm FindRelation (i), the output i parent node and all child nodes (if any). (2) write algorithms Print Print tree binary tree node: first print the root of the binary tree, and then print the left subtree, and finally print the right subtree　(first sequential storage structure traversing Binary)