说明：  创建一个完全二叉树，找到该二叉树的叶子节点并按从左到右从上到下顺序输出叶子节点的值
(Create a complete binary tree, find the leaf node of the binary tree and output the value of the leaf node in the order of left to right, top to bottom)