DSA · Theory

Properties of Binary Tree

← All stacks

Theory

288/810

Properties of Binary Tree

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

For Properties of Binary Tree, Big-O is in play. Don’t blame it until you have traced folder on disk.

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

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

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

After Properties of Binary Tree, Meera should still remember unbalanced BST becoming a list.

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

Exam tip

Say Properties of 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))

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

Short notes

DefProperties of Binary Tree — Meera uses it for folder on disk in a file explorer.
RuleProperties of Binary Tree → left < root < right.
RememberProperties of Binary Tree + Big-O (a file explorer).
UseProperties of Binary Tree in a file explorer (folder on disk).
TrapProperties of Binary Tree — unbalanced BST becoming a list.
ExProperties 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))

Properties of Binary Tree

Example

Short notes

Questions

Properties of Binary Tree

Example

Short notes

Questions