Balanced Binary Tree

最新推荐文章于 2020-12-18 14:21:59 发布

hjhomw

最新推荐文章于 2020-12-18 14:21:59 发布

阅读量221

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/hejun_haitao/article/details/52300786

版权

LeetCode 专栏收录该内容

80 篇文章 0 订阅

订阅专栏

Description:

Given a binary tree, determine if it is height-balanced.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

分析：
这是从网上参考的方法，很简洁，用递归的方法

代码：

#include <iostream>
#include <stack>
#include <algorithm>
#include <memory>

#define Elementype int

using namespace std;



typedef struct TreeNode //树结点
{
    Elementype  val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(Elementype x) : val(x), left(nullptr), right(nullptr) {}
} *Tree;

//全局索引变量
int index = 0;


//使用先序遍历创建创建二叉树
void MakeBinaryTree(Tree &T, Elementype value[])
{
    Elementype  c = value[index++];
    if (c == '#')
        T = nullptr;
    else
    {
        T = new TreeNode(c);
        MakeBinaryTree(T->left, value);
        MakeBinaryTree(T->right, value);
    }

}

int balancedHeight(Tree root)
{
    if (root == nullptr)
        return 0;
    int left = balancedHeight(root->left);
    int right = balancedHeight(root->right);

    if (left == -1 || right == -1 || abs(left - right) > 1)
        return -1;
    return max(left, right) + 1;
}

bool isBalanced(Tree root)
{
    return balancedHeight(root) >= 0;
}

int main()
{
    Tree T1 = nullptr;
    Tree T2 = nullptr;

    //注意，每个结点都要有值,注意这里的取值不要等于35，即#
    Elementype data1[11] = { 3, 9, '#', '#', 20, 15, '#', '#', 7, '#', '#' };
    Elementype data2[11] = { 3, 9, '#', '#', 20, 15, 7, '#', '#', '#', '#' };

    MakeBinaryTree(T1, data1);
    cout << "The tree is balanced or not: " << boolalpha << isBalanced(T1) << endl;



    index = 0;  //重置为0
    MakeBinaryTree(T2, data2);
    cout << "The tree is balanced or not: " << boolalpha << isBalanced(T2) << endl;

    system("pause");
    return 0;
}