DSA · Theory

Full Binary Tree

← All stacks

Theory

292/810

Full Binary Tree

Full Binary Tree sits in a file explorer. Rohit’s job is folder on disk. Write that first.

For Full Binary Tree, a dry-run table is in play. Don’t blame it until you have traced folder on disk.

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

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

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

After Full Binary Tree, Rohit should still remember unbalanced BST becoming a list.

Close Full Binary Tree with — “If I skip it, folder on disk goes wrong like this: unbalanced BST becoming a list.”

Exam tip

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

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

Short notes

DefFull Binary Tree — Rohit uses it for folder on disk in a file explorer.
RuleFull Binary Tree → left < root < right.
RememberFull Binary Tree + a dry-run table (a file explorer).
UseFull Binary Tree in a file explorer (folder on disk).
TrapFull Binary Tree — unbalanced BST becoming a list.
ExFull 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))

Full Binary Tree

Example

Short notes

Questions

Full Binary Tree

Example

Short notes

Questions