GoLang Solution For LeetCode Problem: Balanced Binary Tree
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 depth of the two subtrees of every node never differ by more than 1.
Given the following tree [3,9,20,null,null,15,7]:
3 / \ 9 20 / \ 15 7
Given the following tree [1,2,2,3,3,null,null,4,4]:
1 / \ 2 2 / \ 3 3 / \ 4 4
See the full details of the problem Balanced Binary Tree at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go