DSA · Theory

Enumeration of Binary Tree

← All stacks

Theory

549/810

Enumeration of Binary Tree

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

Do Enumeration of Binary Tree once by hand. left < root < right. Change one input. Say the new result out loud.

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

Use Enumeration of Binary Tree when folder on disk must stay clear. If a simpler DSA step works, use that instead.

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

Enumeration of Binary Tree is not a lonely heading. Isha ties it to folder on disk.

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

Exam tip

Board: folder on disk. Dry-run Enumeration of Binary Tree. Name the trap: 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))

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

Short notes

DefEnumeration of Binary Tree — Isha uses it for folder on disk in a file explorer.
RuleEnumeration of Binary Tree → left < root < right.
RememberEnumeration of Binary Tree + a dry-run table (a file explorer).
UseEnumeration of Binary Tree in a file explorer (folder on disk).
TrapEnumeration of Binary Tree — unbalanced BST becoming a list.
ExEnumeration 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))

Enumeration of Binary Tree

Example

Short notes

Questions

Enumeration of Binary Tree

Example

Short notes

Questions