DSA · Theory

Application of Binary Tree

← All stacks

Theory

271/810

Application of Binary Tree

Sara only reaches for Application of Binary Tree when folder on disk has to stay correct in a file explorer.

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

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

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

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

After Application of Binary Tree, Sara should still remember unbalanced BST becoming a list.

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

Exam tip

Board: folder on disk. Dry-run Application 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))

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

Short notes

DefApplication of Binary Tree — Sara uses it for folder on disk in a file explorer.
RuleApplication of Binary Tree → left < root < right.
RememberApplication of Binary Tree + Big-O (a file explorer).
UseApplication of Binary Tree in a file explorer (folder on disk).
TrapApplication of Binary Tree — unbalanced BST becoming a list.
ExApplication 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))

Application of Binary Tree

Example

Short notes

Questions

Application of Binary Tree

Example

Short notes

Questions