DSA · Theory

Check given array of size n can represent BST of n levels or not

Theory

432/810

Check given array of size n can represent BST of n levels or not

If you can teach Check given array of size n can represent BST of n levels or not using folder on disk, you know it. If you only know the heading, you don’t.

Check given array of size n can represent BST of n levels or not order: meaning → left < root < right → one limit. Dumping ten features helps nobody.

Check given array of size n can represent BST of n levels or not exists so Ananya can keep folder on disk correct in a file explorer.

Check given array of size n can represent BST of n levels or not shows up in a file explorer. Name folder on disk, not “a real-world scenario”.

Check given array of size n can represent BST of n levels or not miss: unbalanced BST becoming a list. Fix it before you talk about advanced DSA.

After Check given array of size n can represent BST of n levels or not, Ananya should still remember unbalanced BST becoming a list.

One breath for Check given array of size n can represent BST of n levels or not, then folder on disk, then unbalanced BST becoming a list. Sit down.

Diagram

Exam tip

For Check given array of size n can represent BST of n levels or not: definition + a file explorer + one failure.

Example

class Node:
    def __init__(self, val):
        self.val = val
        self.left = None
        self.right = None

def insert(root, val):
    if root is None:
        return Node(val)
    if val < root.val:
        root.left = insert(root.left, val)
    elif val > root.val:
        root.right = insert(root.right, val)
    return root

root = None
for v in [5, 2, 7, 1]:
    root = insert(root, v)
print(root.val, root.left.val, root.right.val)

Check given array of size n can represent BST of n levels or not — bST invariant: left < node < right — enables log-time search when balanced.

Short notes

DefCheck given array of size n can represent BST of n levels or not — Ananya uses it for folder on disk in a file explorer.
RuleCheck given array of size n can represent BST of n levels or not → left < root < right.
RememberCheck given array of size n can represent BST of n levels or not + time vs memory (a file explorer).
UseCheck given array of size n can represent BST of n levels or not in a file explorer (folder on disk).
TrapCheck given array of size n can represent BST of n levels or not — unbalanced BST becoming a list.
ExCheck given array of size n can represent BST of n levels or not → folder on disk.

class Node: def __init__(self, val): self.val = val self.left = None self.right = None def insert(root, val): if root is None: return Node(val) if val < root.val: root.left = insert(root.left, val) elif val > root.val: root.right = insert(root.right, val) return root root = None for v in [5, 2, 7, 1]: root = insert(root, v) print(root.val, root.left.val, root.right.val)

Check given array of size n can represent BST of n levels or not

Example

Short notes

Questions

Check given array of size n can represent BST of n levels or not

Example

Short notes

Questions