Java [Leetcode 110]balanced Binary Tree

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

Problem Solving Ideas:

Recursive method to solve problems.

The code is as follows:

/** * Definition for a binary tree node.  * public class TreeNode {*     int val, *     TreeNode left, *     TreeNode right; *     TreeNode (int x) {val = x;} *} */public class Solution {public    Boolean isbalanced (TreeNode root) {    if (root = null)    return true;    else{    if (Math.Abs (GetHeight (root.left)-getheight (Root.right)) > 1)    return false;    else     return isbalanced (root.left) && isbalanced (root.right);    }    }    public int getheight (TreeNode root) {    if (root = null)    return 0;    else return 1 + math.max (getheight (Root.left), GetHeight (Root.right));}    }

　　

Java [Leetcode 110]balanced Binary Tree