首页 > 代码库 > Leetcode | Balanced Binary Tree
Leetcode | Balanced Binary Tree
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.
判断左右子树的高度相差是否大于1.
树的高度取决于左右子树的高度的最大值。
1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), left(NULL), right(NULL) {} 8 * }; 9 */ 10 class Solution { 11 public: 12 bool isBalanced(TreeNode *root) { 13 return getLayer(root, 1) != -1; 14 } 15 16 int getLayer(TreeNode *root, int layer) { 17 if (root == NULL) return layer; 18 int l = getLayer(root->left, layer + 1); 19 if (l == -1) return -1; 20 int r = getLayer(root->right, layer + 1); 21 if (r == -1) return -1; 22 if (abs(l - r) > 1) return -1; 23 return l > r ? l : r; 24 } 25 };
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。