判断是否是平衡二叉树

判断二叉树是否为平衡二叉树
【题目】
平衡二叉树的性质为：要么是一棵空树，要么任何一个节点的左右子树高度差的绝对值不超过1。给定一棵二叉树的头节点head，判断这棵二叉树是否为平衡二叉树。

解题思路：

判断是否是平衡二叉树从两点入手：1、节点左子树和右子树是否是平衡二叉树2、节点左子树和右子树的高度差是否不大于1

JAVA程序：

package problems_2017_08_21;


public class Problem_02_IsBalancedTree {


public static class Node {
public int value;
public Node left;
public Node right;


public Node(int data) {
this.value = data;
}
}


public static boolean isBalance(Node head) {
boolean[] res = new boolean[1];
res[0] = true;
getHeight(head, 1, res);
return res[0];
}


public static int getHeight(Node head, int level, boolean[] res) {
if (head == null) {
return level;
}
int lH = getHeight(head.left, level + 1, res);
if (!res[0]) {
return level;
}
int rH = getHeight(head.right, level + 1, res);
if (!res[0]) {
return level;
}
if (Math.abs(lH - rH) > 1) {
res[0] = false;
}
return Math.max(lH, rH);
}


public static void main(String[] args) {
Node head = new Node(1);
head.left = new Node(2);
head.right = new Node(3);
head.left.left = new Node(4);
head.left.right = new Node(5);
head.right.left = new Node(6);
head.right.right = new Node(7);


System.out.println(isBalance(head));


}


}

C++程序：

#include<iostream>
#include<stdlib.h>
using namespace std;






struct node{
    int val;
node *left;
node *right;


node():val(0),left(NULL),right(NULL){}

};


int high(node *head,int level,bool *p);
bool balancetree(node *head)
{
bool *p=new bool[1];
p[0]=true;
high(head,0,p);
return p[0];


}


int high(node *head,int level,bool *p)
{
if(head==NULL)
return level;


int lhigh=high(head->left,level+1,p);
if(p[0]==false)
return level;


int rhigh=high(head->right,level+1,p);
if(p[0]==false)
return level;


if(abs(lhigh-rhigh)>1)
p[0]=false;


return max(lhigh,rhigh);
}


int main()
{
node *head=new node();
head->val=1;
    head->left=new node();
head->left->val=2;
head->right=new node();
head->right->val=3;
head->left->left=new node();
head->left->left->val=4;
head->left->right=new node();
head->left->right->val=5;
head->right->left=new node();
head->right->left->val=6;
head->right->right=new node();
head->right->right->val=7;


cout<<balancetree(head)<<endl;
system("pause");
return 0;
}