Package g0101_0200.s0110_balanced_binary_tree

Class Solution

java.lang.Object

g0101_0200.s0110_balanced_binary_tree.Solution

public class Solution
extends Object

110 - Balanced Binary Tree\. Easy 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 left and right subtrees of _every_ node differ in height by no more than 1. **Example 1:**  **Input:** root = [3,9,20,null,null,15,7] **Output:** true **Example 2:**  **Input:** root = [1,2,2,3,3,null,null,4,4] **Output:** false **Example 3:** **Input:** root = [] **Output:** true **Constraints:** * The number of nodes in the tree is in the range `[0, 5000]`. * -104 <= Node.val <= 104

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
boolean	isBalanced(TreeNode root)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

isBalanced

public boolean isBalanced(TreeNode root)