1、题目
数据结构之求二叉树的所有叶子和以及叶子总数
2、代码实现
tree.java
package leetcode.chenyu.test;
public class Tree {
int val;
Tree left;
Tree right;
Tree(int val) {
this.val = val;
}
}
package leetcode.chenyu.test;
public class TreeTest {
public static int sum = 0;
public static int count = 0;
public static void main(String[] args) {
Tree t1 = new Tree(1);
Tree t2 = new Tree(2);
Tree t3 = new Tree(3);
Tree t4 = new Tree(4);
Tree t5 = new Tree(5);
t1.left = t2;
t1.right= t3;
t2.lef