DSA · Theory

Weight Balanced Binary Tree

← All stacks

Theory

437/810

Weight Balanced Binary Tree

Weight Balanced Binary Tree is simple if you keep it on paper. Isha uses it for folder on disk in a file explorer.

For Weight Balanced Binary Tree, Big-O is in play. Don’t blame it until you have traced folder on disk.

Without Weight Balanced Binary Tree, a file explorer gets messy and folder on disk is hard to trust.

Isha ships Weight Balanced Binary Tree in a file explorer. That is the use case worth saying.

Weight Balanced Binary Tree miss — unbalanced BST becoming a list. Fix it before you talk about advanced DSA.

Weight Balanced Binary Tree is not a lonely heading. Isha ties it to folder on disk.

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

Exam tip

Say Weight Balanced Binary Tree in one breath, then left < root < right, then unbalanced BST becoming a list.

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))

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

Short notes

DefWeight Balanced Binary Tree — Isha uses it for folder on disk in a file explorer.
RuleWeight Balanced Binary Tree → left < root < right.
RememberWeight Balanced Binary Tree + Big-O (a file explorer).
UseWeight Balanced Binary Tree in a file explorer (folder on disk).
TrapWeight Balanced Binary Tree — unbalanced BST becoming a list.
ExWeight Balanced 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))

Weight Balanced Binary Tree

Example

Short notes

Questions

Weight Balanced Binary Tree

Example

Short notes

Questions