DSA · Theory

Minimum Swap Required to Convert Binary Tree to Binary Search Tree

Theory

733/810

Minimum Swap Required to Convert Binary Tree to Binary Search Tree

Priya only reaches for Minimum Swap Required to Convert Binary Tree to Binary Search Tree when folder on disk has to stay correct in a file explorer.

Minimum Swap Required to Convert Binary Tree to Binary Search Tree on the board: left < root < right. Then say what folder on disk looks like after.

Without Minimum Swap Required to Convert Binary Tree to Binary Search Tree, a file explorer gets messy and folder on disk is hard to trust.

Priya ships Minimum Swap Required to Convert Binary Tree to Binary Search Tree in a file explorer. That is the use case worth saying.

Don’t do this with Minimum Swap Required to Convert Binary Tree to Binary Search Tree: unbalanced BST becoming a list. Interviewers spot it in ten seconds.

Place Minimum Swap Required to Convert Binary Tree to Binary Search Tree next to nearby DSA work — left < root < right is the link.

One breath for Minimum Swap Required to Convert Binary Tree to Binary Search Tree, then folder on disk, then unbalanced BST becoming a list. Sit down.

Diagram

Exam tip

Board: folder on disk. Dry-run Minimum Swap Required to Convert Binary Tree to Binary Search Tree. 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))

Minimum Swap Required to Convert Binary Tree to Binary Search Tree — binary search halves a sorted array each step — O(log n).

Short notes

DefMinimum Swap Required to Convert Binary Tree to Binary Search Tree — Priya uses it for folder on disk in a file explorer.
RuleMinimum Swap Required to Convert Binary Tree to Binary Search Tree → left < root < right.
RememberMinimum Swap Required to Convert Binary Tree to Binary Search Tree + Big-O (a file explorer).
UseMinimum Swap Required to Convert Binary Tree to Binary Search Tree in a file explorer (folder on disk).
TrapMinimum Swap Required to Convert Binary Tree to Binary Search Tree — unbalanced BST becoming a list.
ExMinimum Swap Required to Convert Binary Tree to Binary Search Tree → 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))

Minimum Swap Required to Convert Binary Tree to Binary Search Tree

Example

Short notes

Questions

Minimum Swap Required to Convert Binary Tree to Binary Search Tree

Example

Short notes

Questions