publicintmaxDeath(Node node){if(node == null)return0;int left =maxDeath(node.leftNode);int right =maxDeath(node.rightNode);return Math.max(left,right)+1;}
求二叉树节点个数
publicintgetNodenum(Node root){if(root == null)return0;int left =getNodenum(root.leftNode);int right =getNodenum(root.rightNode);return left+right+1;}
求树最小深度
publicintminDeath(Node root){if(root == null)return0;int left =minDeath(root.leftNode);int right =minDeath(root.rightNode);return Math.min(left,right)+1;}
求左右树节点个数(不包含根节点)
publicintgetNumOfChildNode(Node root){if(root == null)return0;int left =getNumOfChildNode(root.leftNode);int right =getNumOfChildNode(root.rightNode);return left+right;}
判断是否为平衡二叉树
//平衡树条件:一颗树没一层节点的左子树和右子树的最大层数不能相差超过一publicbooleanisbalancedTree(Node root){//-1表示破坏平衡,returngetAbsDeath(root,1)!=-1;}//当树中出现左右子树的深度差大于n时放回-1,否则返回最大深度publicintgetAbsDeath(Node root,int n){//空返回0if(root == null)return0;//获取左右子树的深度int left =getAbsDeath(root.leftNode,n);int right =getAbsDeath(root.rightNode,n);//左右深度相差>2,破坏相对条件,返回-1,左右子树哪一边破开相对条件也返回-1if(left ==-1|| right==-1|| Math.abs(left-right)>n)return-1;//相对条件没被破坏,继续统计层数return Math.max(left,right)+1;}
二叉树常用方法(一)树节点public class Node { public int data; public Node leftNode; public Node rightNode; public Node(){ this.data = -1; } public Node(int data){ this.data = data; this.leftNode = null; this.