LeetCode 110 Balanced Binary Tree
发布时间:2020-12-14 03:23:06 所属栏目:大数据 来源:网络整理
导读: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. Example 1: Given the fo
Given a binary tree,determine if it is height-balanced. For this problem,a height-balanced binary tree is defined as:
Example 1: Given the following tree? Return true. Given the following tree? Return false. ? 判断是否为平衡二叉树 c++ class Solution { public: bool isBalanced(TreeNode* root) { if(root == NULL) return true; bool tagleft=true;bool tagright=true; int dleft=0;int dright=0; if(root->left!=NULL) tagleft = isBalanced(root->left); if(root->right!=NULL) tagright = isBalanced(root->right); if(root->left!=NULL) dleft = deep(root->left); if(root->right!=NULL) dright = deep(root->right); if(tagleft&&tagright&&abs(dleft-dright)<=1) return true; else return false; } int deep(TreeNode* root) { int dleft=0;int dright=0; if(root->left!=NULL) dleft = deep(root->left); if(root->right!=NULL) dright = deep(root->right); return max(dleft,dright)+1; } }; (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |