[Leetcode] (python): Balanced Binary Tree

Source of the topic

https://leetcode.com/problems/balanced-binary-tree/

Given a binary tree, determine if it is height-balanced.

For this problem, a height-balanced binary tree was defined as a binary tree in which the depth of the Every node never differ by more than 1.

Test instructions Analysis

Input:a binary Tree

Output:true or False

Conditions: Judging whether a tree is a balance tree, the balance tree means: For each node, the maximum depth of the left and right subtree is not more than 1

Topic ideas

Recursive judgment.

AC Code (PYTHON)

1 #Definition for a binary tree node.2 #class TreeNode (object):3 #def __init__ (self, x):4 #self.val = x5 #self.left = None6 #self.right = None7 8 classsolution (object):9     defHeight (self, root):Ten         ifRoot = =None: One             return0 A         returnMax (self. Height (Root.left), self. Height (root.right)) + 1 -     defisbalanced (self, root): -         """ the : Type Root:treenode - : Rtype:bool -         """ -         ifRoot = =None: +             returnTrue -         ifABS (self. Height (Root.left)-Self. Height (root.right)) <= 1: +             returnself.isbalanced (Root.left) andself.isbalanced (root.right) A         Else: at             returnFalse

[Leetcode] (python): Balanced Binary Tree