Shulou(Shulou.com)06/02 Report--

In this issue, the editor will bring you about how to use leetcode to achieve a balanced binary tree in golang. The article is rich in content and analyzes and describes it from a professional point of view. I hope you can get something after reading this article.

Enter the root node of a binary tree to determine whether the tree is a balanced binary tree. If the depth difference between the left and right subtrees of any node in a binary tree is less than 1, then it is a balanced binary tree.

Example 1:

Given binary tree [3pc9pr 20pr nullpr nullpr 15pc7]

three

/\

9 20

/\

15 7

Return to true.

Example 2:

Given binary tree [1, 2, 2, 2, 3, 3, 3, 3, 3, 6, 5, 3, 3, 3, 3, 6, 5, 5, 6, 4, 4]

one

/\

2 2

/\

3 3

/\

4 4

Return to false.

Restrictions:

one

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.