DFS
def height(node):
if not node:
return 0
left = height(node.left)
right = height(node.right)
return max(left, right) + 1def height(node):
if not node:
return 0
left = height(node.left)
right = height(node.right)
return max(left, right) + 1