【Leetcode -110.平衡二叉树 -226.翻转二叉树】

		//计算子树的高度
		int TreeHeight(struct TreeNode* root)
		{
		    if (root == NULL)
		        return 0;
		
		    int h1 = TreeHeight(root->left) + 1;
		    int h2 = TreeHeight(root->right) + 1;
		
		    //返回深度较高的
		    return h1 > h2 ? h1 : h2;
		}
		
		
		bool isBalanced(struct TreeNode* root)
		{
		    if (root == NULL)
		        return true;
		
		    //判断当前根的左右子树高度差是否大于1
		    if (abs(TreeHeight(root->left) - TreeHeight(root->right)) > 1)
		        return false;
		
		    //如果当前根左右子树高度差小于等于1，递归其左子树的根和右子树的根进行判断
		    return isBalanced(root->left) && isBalanced(root->right);
		
		}

		struct TreeNode* invertTree(struct TreeNode* root)
		{
		    if (root == NULL)
		        return NULL;
		
		    //将当前左根和右根记录下来
		    struct TreeNode* LeftRoot = invertTree(root->left);
		    struct TreeNode* RightRoot = invertTree(root->right);
		
		    //根的左右子树交换
		    root->left = RightRoot;
		    root->right = LeftRoot;
		
		    return root;
		}