java实现二叉树的创建，遍历

一、新建一个TreeTest类
package cn.netJava.likai5;

public class TreeTest {
private static int count=0;
//创建一个二叉树
public TreeNode creatTree(TreeNode foot){
int a[]={1,2,3,4,5,6,7};
TreeNode t=new TreeNode();
t=foot;
foot.data=a[0];
for(int i=1;i<a.length;i+=2){
TreeNode left=new TreeNode();
left.data=a[i];
TreeNode right=new TreeNode();
right.data=a[i+1];
foot.left=left;
foot.right=right;
foot=foot.left;
}
return t;
}

//遍历并打印该树
public void print(TreeNode foot){
if(foot!=null){
System.out.println("节点 "+foot.data);
print(foot.left);
print(foot.right);
}
}

//统计叶子节点个数
static int countLeaf(TreeNode foot){

if(foot!=null){
if(foot.left!=null&&foot.right!=null){
++count;
}
countLeaf( foot.left);
countLeaf(foot.right);
}

return count;
}
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
TreeTest tt=new TreeTest();
TreeNode foot=new TreeNode();
TreeNode foot1 =tt.creatTree(foot);
tt.print(foot1);
int m=countLeaf(foot);
System.out.println("叶子节点个数："+m);
}

}

二、创建一个TreeNode类
package cn.netJava.likai5;

public class TreeNode {
public int data;
public TreeNode foot;
public TreeNode left;
public TreeNode right;
}