二叉树的前中后序遍历层次遍历，以及求节点数高度。求节点的父节点-Before, during and after the binary tree traversal hierarchy traversal, as well as the number of nodes required height. Find parent node