DSA · Theory

Get a Parent Binary Tree

← All stacks

Theory

313/810

Get a Parent Binary Tree

Don’t start Get a Parent Binary Tree with jargon. Start with folder on disk. That is the whole point.

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

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

Get a Parent Binary Tree shows up in a file explorer. Name folder on disk, not “a real-world scenario”.

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

After Get a Parent Binary Tree, Neha should still remember unbalanced BST becoming a list.

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

Exam tip

Say Get a Parent 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))

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

Short notes

DefGet a Parent Binary Tree — Neha uses it for folder on disk in a file explorer.
RuleGet a Parent Binary Tree → left < root < right.
RememberGet a Parent Binary Tree + time vs memory (a file explorer).
UseGet a Parent Binary Tree in a file explorer (folder on disk).
TrapGet a Parent Binary Tree — unbalanced BST becoming a list.
ExGet a Parent 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))

Get a Parent Binary Tree

Example

Short notes

Questions

Get a Parent Binary Tree

Example

Short notes

Questions