求树的高度： 先利用递归算法依次比较每一层树的左右子树是否为空，通过层层比较，得出树高，再通过树高用遍历得出路径。-Find height of the tree: the first use of a recursive algorithm sequentially comparing each sub-tree layer around the tree is empty, through the layers of comparison, the tree height, tree h