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.
  1. Prepare
  2. Tutorials
  3. 30 Days of Code
  4. Day 22: Binary Search Trees
  5. Discussions

Day 22: Binary Search Trees

  • mrkobel
     + 0 comments

    This is what I came up with:

        def getHeight(self,root):
        if root is None:
            return -1
        else:
            return max(self.getHeight(root.left),self.getHeight(root.right)) + 1