面试训练判断二叉树是不是平衡

题目：输入一棵二叉树的根结点，判断该树是不是平衡二叉树。如果某二叉树中任意结点的左右子树的深度相差不超过1，那么它就是一棵平衡二叉树。例如下图中的二叉树就是一棵平衡二叉树：

思路：每一个节点计算depth，后序遍历来判断，采用二叉排序树建树

练习点：二叉排序树建立

                二叉排序树遍历，深度求解

                 平衡二叉树定义

#include "stdio.h"
#include "stdlib.h"
typedef struct Node
{
	int data;
	struct Node *left;
	struct Node *right;
}TreeNode;
void buildTree(TreeNode **root,int data)
{
	if(*root == NULL)
	{
		*root = ( TreeNode *)malloc(sizeof( TreeNode));
		((*root)->data) = data;
		((*root)->left) = NULL;
		((*root)->right) = NULL;
		return;
	} 
	if((*root)->data >= data)
	{
		buildTree(&((*root)->left),data);
	}
	else  
	{
		buildTree(&((*root)->right),data);
	}
}
int depth(TreeNode *root)
{
	int left,right;
	if(root == NULL)
		return 0;

    left = depth(root->left)+1;
	right = depth(root->right)+1;
	return (left>right?left:right);
}
void traverse(TreeNode *root,int *ret)
{
	int gap;
	int left,right;
	if(root == NULL)
		return;

	traverse(root->left,ret);
	traverse(root->right,ret);
	left = depth(root->left);
	right = depth(root->right);
	gap=left-right;
	if((gap>=-1)&&(gap<=1))
	{
		
	}
	else
	{
		*ret = -1;
	}
}
int main()
{
	TreeNode *root=NULL ;
	int data[] = {6,4,7,2,5,1};
	int i;
	int ret=1;
	int len = sizeof(data)/sizeof(int);
	for(i=0;i<len;i++)
	buildTree(&root,data[i]);
	traverse(root,&ret);
	if(ret == 1)
	{
		printf("ok\n");
	}
	else if(ret == -1)
	{
		printf("no\n");
	}
	return 0;
}

添加另一种解法，涛哥文中的后序遍历

思路：采用后序遍历二叉树，记录当前遍历节点的高度，当然为当前节点左子树和右子树两个中的最大高度，求出左右子树最大高度然后加1为当前节点高度。这样从下往上遍历判断平衡，可以省去很多步骤。

代码如下

#include "stdio.h"
#include "stdlib.h"
typedef struct Node
{
	int data;
	struct Node *left;
	struct Node *right;
}TreeNode;
void buildTree(TreeNode **root,int data)
{
	if(*root == NULL)
	{
		*root = ( TreeNode *)malloc(sizeof( TreeNode));
		((*root)->data) = data;
		((*root)->left) = NULL;
		((*root)->right) = NULL;
		return;
	} 
	if((*root)->data >= data)
	{
		buildTree(&((*root)->left),data);
	}
	else  
	{
		buildTree(&((*root)->right),data);
	}
}
int depth(TreeNode *root)
{
	int left,right;
	if(root == NULL)
		return 0;

    left = depth(root->left)+1;
	right = depth(root->right)+1;
	return (left>right?left:right);
}
int isBalanced(TreeNode *root,int *depth,int *v)
{
	int left,right;
	int gap;
	if(root == NULL)
	{
		*depth =0;
		return 1;
	}
	if(isBalanced(root->left,&left,v)&&isBalanced(root->right,&right,v))
	{
		gap = left - right;
		if(gap>=-1&&gap<=1)
		{
			depth = 1+(left >right ?left:right);
			return 1;
		}
	}
	*v = -1;
	return -1;
}
void traverse(TreeNode *root,int *ret)
{
	int gap;
	int left,right;
	if(root == NULL)
		return;

	traverse(root->left,ret);
	traverse(root->right,ret);
	left = depth(root->left);
	right = depth(root->right);
	gap=left-right;
	if((gap>=-1)&&(gap<=1))
	{
		
	}
	else
	{
		*ret = -1;
	}
}
int main()
{
	TreeNode *root=NULL ;
	int data[] = {6,4,7,2,5};
	int i;
	int ret=1;
	int v=1;
	int len = sizeof(data)/sizeof(int);
	for(i=0;i<len;i++)
	buildTree(&root,data[i]);
	
	
	isBalanced(root,&ret,&v);
	if(v == 1)
	{
		printf("ok\n");
	}
	else if(v == -1)
	{
		printf("no\n");
	}

	return 0;
}