You are viewing a single comment's thread. Return to all comments →
def height(curr_node, level=-1): if curr_node is None: return level return max(height(curr_node.left, level + 1), height(curr_node.right, level + 1))
`
Seems like cookies are disabled on this browser, please enable them to open this website
Tree: Height of a Binary Tree
You are viewing a single comment's thread. Return to all comments →
`