You are viewing a single comment's thread. Return to all comments →
Python: `def height(root): if root.left == None and root.right== None: return 0 elif root.left == None: return 1+ height(root.right) elif root.right == None: return 1+ height(root.left) else: return 1 + max(height(root.left),height(root.right))`
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 →