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. Practice
  2. Data Structures
  3. Trees
  4. Tree: Height of a Binary Tree
  5. Discussions

Tree: Height of a Binary Tree

  • isarkisov
     + 0 comments
    def height(root):
    if root is None:
        return -1
    return max(1 + height(root.left), 1 + height(root.right))