https://blog.cluas.eu.org/tags/tree/Recent content in Tree on Cluas's blogHugo -- gohugo.iozh-cnMon, 17 Aug 2020 18:35:24 +0800https://blog.cluas.eu.org/2020/balanced-binary-tree/Mon, 17 Aug 2020 18:35:24 +0800https://blog.cluas.eu.org/2020/balanced-binary-tree/Description 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: Given the following tree [3,9,20,null,null,15,7]: 3 / \ 9 20 / \ 15 7 Return true. Example 2: Given the following tree [1,2,2,3,3,null,null,4,4]: 1 / \ 2