We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
if root.left:
left = self.getHeight(root.left) + 1
else:
left = 0
if root.right:
right =self.getHeight(root.right) +1
else:
right = 0
return max(left, right)
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Day 22: Binary Search Trees
You are viewing a single comment's thread. Return to all comments →
Python 3 solution
python def getHeight(self,root):