Leetcode Balanced Binary Tree

Source: Internet
Author: User

Title Description

Given a binary tree, determine if it is height-balanced.

For this problem, a height-balanced binary tree was defined as a binary tree in which the depth of the subtrees of the Y node never differ by more than 1.


Judging whether a tree is a balanced binary tree, recursively seeking the tree height of the Saozi right subtree of each node, judging the difference of the height of the Saozi right sub-tree not exceeding 1

Code implementation
classsolution{ Public: bool Isbalanced (TreeNode *root) {return balancedheight (root) >=0; }intBalancedheight (treenode* root) {if(root==NULL) return0;int  Left=balancedheight (root-> Left);int  Right=balancedheight (root-> Right);if( Left<0|| Right<0||ABS( Left- Right) >1) Return-1; Return Max ( Left, Right)+1; } };

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Leetcode Balanced Binary Tree

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.