判断一棵树是否是满二叉树
1.满二叉树定义
除最后一层无子节点外,其他层的所有节点都有两个子节点的二叉树就是满二叉树。如下图所示:
2.如何判断一棵树是否是满二叉树
如果一棵树的高度为 n ,他的所有节点个数是 2^n-1,那么这棵二叉树是满二叉树
3.代码
//定义树
public class Node {
public int data;
public Node leftNode;
public Node rightNode;
public Node() {
}
public Node(int data) {
this.data=data;
}
public Node(int data, Node leftNode, Node rightNode) {
this.data = data;
this.leftNode = leftNode;
this.rightNode = rightNode;
}
}
//定义判断是否是满二叉树的信息的类
public class Info {
public int height;
public int nodes;
public Info(int height,int nodes) {
this.height=height;
this.nodes=nodes;
}
}
//判断是否是满二叉树
public class Tree {
private Node root;
//判断一棵树是否是满二叉树
public boolean isF() {
return isF(root);
}
public static boolean isF(Node head) {
//如果是空树,则就是满二叉树,返回true
if(head==null) {
return true;
}
//创建树的信息的对象
Info data=f(head);
//判断是否是满二叉树 条件:nodes=2^height-1
return data.nodes==((1<<data.height)-1);
}
public static Info f(Node x) {
//如果某个节点为空,则返回高度为0,节点数为0
if(x==null) {
return new Info(0,0);
}
//递归遍历左子树
Info leftData=f(x.leftNode);
//递归遍历右子树
Info rightData=f(x.rightNode);
//计算树的高度[左子树和右子树的最大值再加1]
int height=Math.max(leftData.height, rightData.height)+1;
//计算节点个数[左子树的节点个数加右子树的节点个数再加1]
int nodes=leftData.nodes+rightData.nodes+1;
//返回树的高度和节点个数
return new Info(height,nodes);
}
}
//测试类
public class Test {
public static void main(String[] args) {
Tree tree=new Tree();
Node node=new Node(6,new Node(4,new Node(3),new Node(5)),new Node(8,new Node(7),new Node(9)));
boolean d=tree.isF(node);
System.out.println("这棵树是不是满二叉树:"+ d);
}
}