DSA · Theory

Find the Index of the Number Using a Binary Tree

Theory

332/810

Find the Index of the Number Using a Binary Tree

If you can teach Find the Index of the Number Using a Binary Tree using folder on disk, you know it. If you only know the heading, you don’t.

Do Find the Index of the Number Using a Binary Tree once by hand. left < root < right. Change one input. Say the new result out loud.

Without Find the Index of the Number Using a Binary Tree, a file explorer gets messy and folder on disk is hard to trust.

Find the Index of the Number Using a Binary Tree shows up in a file explorer. Name folder on disk, not “a real-world scenario”.

If folder on disk breaks under Find the Index of the Number Using a Binary Tree, check unbalanced BST becoming a list first.

Find the Index of the Number Using a Binary Tree is not a lonely heading. Ananya ties it to folder on disk.

Viva for Find the Index of the Number Using a Binary Tree: what it is → left < root < right → the mistake (unbalanced BST becoming a list).

Exam tip

Board: folder on disk. Dry-run Find the Index of the Number Using a 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))

Find the Index of the Number Using a Binary Tree — inorder walks left → node → right (sorted order for a BST).

Short notes

DefFind the Index of the Number Using a Binary Tree — Ananya uses it for folder on disk in a file explorer.
RuleFind the Index of the Number Using a Binary Tree → left < root < right.
RememberFind the Index of the Number Using a Binary Tree + a dry-run table (a file explorer).
UseFind the Index of the Number Using a Binary Tree in a file explorer (folder on disk).
TrapFind the Index of the Number Using a Binary Tree — unbalanced BST becoming a list.
ExFind the Index of the Number Using a 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))

Find the Index of the Number Using a Binary Tree

Example

Short notes

Questions

Find the Index of the Number Using a Binary Tree

Example

Short notes

Questions