Balanced Binary Tree

Given the root of a binary tree, return whether it is height-balanced. A height-balanced binary tree is a binary tree in which the depth of the two subtrees of every node never differs by more than 1.

Examples
Input: [1,2,3,4,5]
Output: true
Hints

Balanced Binary Tree

Given the root of a binary tree, return whether it is height-balanced. A height-balanced binary tree is a binary tree in which the depth of the two subtrees of every node never differs by more than 1.