DSA · Theory

Check whether the two Binary Search Trees are Identical or Not

Theory

701/810

Check whether the two Binary Search Trees are Identical or Not

Zara only reaches for Check whether the two Binary Search Trees are Identical or Not when folder on disk has to stay correct in a file explorer.

Keep Check whether the two Binary Search Trees are Identical or Not small. Zara should finish folder on disk in a few lines, not a 40-line dump.

Skip Check whether the two Binary Search Trees are Identical or Not and unbalanced BST becoming a list shows up in a file explorer.

Zara ships Check whether the two Binary Search Trees are Identical or Not in a file explorer. That is the use case worth saying.

Check whether the two Binary Search Trees are Identical or Not miss: unbalanced BST becoming a list. Fix it before you talk about advanced DSA.

After Check whether the two Binary Search Trees are Identical or Not, Zara should still remember unbalanced BST becoming a list.

Viva for Check whether the two Binary Search Trees are Identical or Not: what it is → left < root < right → the mistake (unbalanced BST becoming a list).

Diagram

Exam tip

Board: folder on disk. Dry-run Check whether the two Binary Search Trees are Identical or Not. Name the trap: unbalanced BST becoming a list.

Example

def binary_search(arr, target):
    lo, hi = 0, len(arr) - 1
    while lo <= hi:
        mid = (lo + hi) // 2
        if arr[mid] == target:
            return mid
        if arr[mid] < target:
            lo = mid + 1
        else:
            hi = mid - 1
    return -1

print(binary_search([1, 3, 5, 7, 9], 7))

Check whether the two Binary Search Trees are Identical or Not — binary search halves a sorted array each step — O(log n).

Short notes

DefCheck whether the two Binary Search Trees are Identical or Not — Zara uses it for folder on disk in a file explorer.
RuleCheck whether the two Binary Search Trees are Identical or Not → left < root < right.
RememberCheck whether the two Binary Search Trees are Identical or Not + a dry-run table (a file explorer).
UseCheck whether the two Binary Search Trees are Identical or Not in a file explorer (folder on disk).
TrapCheck whether the two Binary Search Trees are Identical or Not — unbalanced BST becoming a list.
ExCheck whether the two Binary Search Trees are Identical or Not → folder on disk.

def binary_search(arr, target): lo, hi = 0, len(arr) - 1 while lo <= hi: mid = (lo + hi) // 2 if arr[mid] == target: return mid if arr[mid] < target: lo = mid + 1 else: hi = mid - 1 return -1 print(binary_search([1, 3, 5, 7, 9], 7))

Check whether the two Binary Search Trees are Identical or Not

Example

Short notes

Questions

Check whether the two Binary Search Trees are Identical or Not

Example

Short notes

Questions