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

Tree: Height of a Binary Tree

Sort by

recency

|

969 Discussions

|

  • frederick_bensia
     + 1 comment

    You muppets. The javascript implementation contains all nodes in the right. Creating a right skewed tree.

    e.g. 

    {
    "data": 3,
    "left": null,
    "right": {
        "data": null,
        "left": null,
        "right": {
            "data": null,
            "left": null,
            "right": {
                "data": null,
                "left": null,
                "right": {
                    "data": null,
                    "left": null,
                    "right": null
                }
            }
        }
    }
}

  • manceraaxel
     + 0 comments
    def height(root):
    queue = deque([root])
    height = -1

    while queue:
        level_len = len(queue)
        height += 1

        for _ in range(level_len):
            current = queue.popleft()
            if current.left:
                queue.append(current.left)
            if current.right:
                queue.append(current.right)
    
    return height

  • outfit_wattage_1
     + 2 comments

    Typescript missing boilerplate

  • outfit_wattage_1
     + 1 comment

    C# missing boilerplate

  • apekshavh1
     + 0 comments

    PYTHON solution

    def height(root):
    left_h, right_h = 0, 0
    if root.left:
        left_h = 1 + height(root.left)
    if root.right:
        right_h = 1 + height(root.right)
    return max(left_h, right_h)