You are viewing a single comment's thread. Return to all comments →
python
def height(root): if root is None: return -1 h_left=height(root.left) h_right=height(root.right) return max(h_left,h_right) +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 →
python