Balanced Binary Tree

Source: Internet
Author: User

Balanced Binary TreeTotal accepted:86508 Total submissions:263690 difficulty:easy

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 Every node never differ by more than 1.

/** Definition for a binary tree node. * struct TreeNode {* int val; * TreeNode *left; * TreeNode *right; * TreeNode (int x): Val (x), left (null), right (NULL) {} *}; */classSolution { Public:    intGettreeheight (treenode*root) {        if(root==NULL) {            return 0; }        intLH = Gettreeheight (root->Left ); intRH = Gettreeheight (root->Right ); returnLh>rh? lh+1: rh+1; }    BOOLIsbalanced (treenode*root) {        if(root==NULL) {            return true; }        intLH = Gettreeheight (root->Left ); intRH = Gettreeheight (root->Right ); if(Fabs (LH-RH) <=1){            returnisbalanced (Root->left) && isbalanced (root->Right ); }Else{            return false; }    }};
Next challenges: (E) Maximum Depth of Binary Tree

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: 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.