Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
24 lines (22 loc) · 694 Bytes

File metadata and controls

24 lines (22 loc) · 694 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
# Definition for a binary tree node
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
# @param root, a tree node
# @return a boolean
def isBalanced(self, root):
if root is None:
return True
else:
if self.isBalanced(root.left) and self.isBalanced(root.right):
return abs(self.depth(root.left) - self.depth(root.right)) <= 1
else:
return False
def depth(self, root):
if root is None:
return -1
else:
return max(self.depth(root.left), self.depth(root.right)) + 1
Morty Proxy This is a proxified and sanitized view of the page, visit original site.