Question: Implement a function to check if a binary tree is balanced.

Answer:

class TreeNode:
def __init__(self, value):
self.value = value
self.left = None
self.right = None

def is_balanced(root):
if root is None:
return True
left_height = height(root.left)
right_height = height(root.right)
return abs(left_height - right_height) <= 1 and is_balanced(root.left) and is_balanced(root.right)

def height(node):
if node is None:
return 0
return max(height(node.left), height(node.right)) + 1

Example:

# Example usage: Check if 'root' is a balanced binary tree
is_balanced(root)

Is it helpful? Yes No

Most helpful rated by users:

Implement a function to find the maximum element in a list.
Write a function to reverse a string.
Implement a function to check if a string is a palindrome.
Write a Python function to check if a given year is a leap year.
Write a Python program to count the occurrences of each element in a list.