判断一棵树是否为高度平衡二叉树（C++实现）

C++实现高度平衡二叉树的判断

1. 二叉树的实现

// 二叉树结构体
struct TreeNode {
    TreeNode() : m_val(0), m_left_node(NULL), m_right_node(NULL) { }
    TreeNode(int val) : m_val(val), m_left_node(NULL), m_right_node(NULL) { }
    TreeNode(int val, TreeNode* left_node, TreeNode* right_node) : m_val(val), m_left_node(left_node), m_right_node(right_node) { }
    int m_val;
    TreeNode* m_left_node;
    TreeNode* m_right_node;
};

2. 判断逻辑-获取高度

    int GetHeight(TreeNode* cur_node) {
        if (!cur_node) return 0;
        int left_height = GetHeight(cur_node->m_left_node);
        if (left_height == -1) return -1;
        int right_height = GetHeight(cur_node->m_right_node);
        if (right_height == -1) return -1;
        return std::abs(left_height - right_height) > 1 ? -1 : (1 + std::max(left_height, right_height));
    }

3. 整体代码

/*
    给定一个二叉树，判断它是否是高度平衡的二叉树。
    一棵高度平衡二叉树定义为: 一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过1。    
*/

#include <iostream>
#include <math.h>

// 二叉树结构体
struct TreeNode {
    TreeNode() : m_val(0), m_left_node(NULL), m_right_node(NULL) { }
    TreeNode(int val) : m_val(val), m_left_node(NULL), m_right_node(NULL) { }
    TreeNode(int val, TreeNode* left_node, TreeNode* right_node) : m_val(val), m_left_node(left_node), m_right_node(right_node) { }
    int m_val;
    TreeNode* m_left_node;
    TreeNode* m_right_node;
};


class Solution {
public:
    bool Plan(TreeNode* root) {
        return GetHeight(root) == -1 ? false : true;
    }

    int GetHeight(TreeNode* cur_node) {
        if (!cur_node) return 0;
        int left_height = GetHeight(cur_node->m_left_node);
        if (left_height == -1) return -1;
        int right_height = GetHeight(cur_node->m_right_node);
        if (right_height == -1) return -1;
        return std::abs(left_height - right_height) > 1 ? -1 : (1 + std::max(left_height, right_height));
    }

    // 释放资源
    void FreeSpace(TreeNode* root) {
        if (!root) return;
        if (root->m_left_node) FreeSpace(root->m_left_node);
        if (root->m_right_node) FreeSpace(root->m_right_node);
        delete root;
    }
};

int main() {
    // 定义一棵树
    TreeNode* root = new TreeNode(5, new TreeNode(6, new TreeNode(8), new TreeNode(9)), new TreeNode(7, NULL, NULL));
    // TreeNode* root = new TreeNode(5, new TreeNode(6, new TreeNode(8), new TreeNode(9)), NULL);
    Solution solution;
    std::cout << "res: " << solution.Plan(root) << std::endl;
    // 释放资源
    solution.FreeSpace(root);
    return 0;
}