You are viewing a single comment's thread. Return to all comments →
def height(root): if root is None: return -1 return max(1 + height(root.left), 1 + height(root.right))
def height(root): if not root: return -1 return max(height(root.left), height(root.right)) + 1
one liner using your logic
return -1 if root is None else max(height(root.left) + 1, height(root.right) + 1)
Tree: Height of a Binary Tree
You are viewing a single comment's thread. Return to all comments →
one liner using your logic