求二叉树中从根结点到叶子节点的路径

//实现功能：

//2．　　求二叉树中从根结点到叶子节点的路径

//需求分析：

//对于二叉树，分别用递归和非递归的方法编写程序完成如下功能：

//1．　　输出所有的叶子结点的数据项值。

//2．　　输出所有从叶子节点到根结点的路径

//3．　　输出（2）中的第一条最长的路径

//程序存在的问题：数值只能输入0~9，其他基本满足要求

//测试数据先序输入：124 7 35 68 9-Find a binary tree from root to leaf node of the path// Function:// 2. Find a binary tree from root to leaf node of the path// needs analysis:// For binary trees, respectively, recursive and non recursive method to program the following functions:// 1. Output all leaf nodes of the data item value.// 2. Output from the leaf node to the root of all the path// 3. Output (2) The first of the longest path// Program problems: can only enter the value 0 to 9, to meet other basic requirements// test data input first order: 124,735,689