DSA · Theory

Height of Binary Tree

← All stacks

Theory

172/810

Height of Binary Tree

Height of Binary Tree is simple if you keep it on paper. Meera uses it for folder on disk in a file explorer.

Height of Binary Tree order — meaning → left < root < right → one limit. Dumping ten features helps nobody.

Skip Height of Binary Tree and unbalanced BST becoming a list shows up in a file explorer.

Meera ships Height of Binary Tree in a file explorer. That is the use case worth saying.

Height of Binary Tree trap — unbalanced BST becoming a list. Meera loses marks for that every viva.

After Height of Binary Tree, Meera should still remember unbalanced BST becoming a list.

One breath for Height of Binary Tree, then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

For Height of Binary Tree: definition + a file explorer + one failure.

Example

class Node:
    def __init__(self, val, left=None, right=None):
        self.val, self.left, self.right = val, left, right

def inorder(n):
    if not n:
        return []
    return inorder(n.left) + [n.val] + inorder(n.right)

root = Node(2, Node(1), Node(3))
print(inorder(root))

Height of Binary Tree — inorder walks left → node → right (sorted order for a BST).

Short notes

DefHeight of Binary Tree — Meera uses it for folder on disk in a file explorer.
RuleHeight of Binary Tree → left < root < right.
RememberHeight of Binary Tree + time vs memory (a file explorer).
UseHeight of Binary Tree in a file explorer (folder on disk).
TrapHeight of Binary Tree — unbalanced BST becoming a list.
ExHeight of Binary Tree → folder on disk.

class Node: def __init__(self, val, left=None, right=None): self.val, self.left, self.right = val, left, right def inorder(n): if not n: return [] return inorder(n.left) + [n.val] + inorder(n.right) root = Node(2, Node(1), Node(3)) print(inorder(root))

Height of Binary Tree

Example

Short notes

Questions

Height of Binary Tree

Example

Short notes

Questions