DSA · Theory

Difference between Binary Search tree and AVL Tree

Theory

73/810

Difference between Binary Search tree and AVL Tree

Ananya only reaches for Difference between Binary Search tree and AVL Tree when folder on disk has to stay correct in a file explorer.

Do Difference between Binary Search tree and AVL Tree once by hand. left < root < right. Change one input. Say the new result out loud.

Skip Difference between Binary Search tree and AVL Tree and unbalanced BST becoming a list shows up in a file explorer.

Difference between Binary Search tree and AVL Tree shows up in a file explorer. Name folder on disk, not “a real-world scenario”.

Don’t do this with Difference between Binary Search tree and AVL Tree: unbalanced BST becoming a list. Interviewers spot it in ten seconds.

After Difference between Binary Search tree and AVL Tree, Ananya should still remember unbalanced BST becoming a list.

One breath for Difference between Binary Search tree and AVL Tree, then folder on disk, then unbalanced BST becoming a list. Sit down.

Diagram

Exam tip

Board: folder on disk. Dry-run Difference between Binary Search tree and AVL 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))

Difference between Binary Search tree and AVL Tree — binary search halves a sorted array each step — O(log n).

Short notes

DefDifference between Binary Search tree and AVL Tree — Ananya uses it for folder on disk in a file explorer.
RuleDifference between Binary Search tree and AVL Tree → left < root < right.
RememberDifference between Binary Search tree and AVL Tree + Big-O (a file explorer).
UseDifference between Binary Search tree and AVL Tree in a file explorer (folder on disk).
TrapDifference between Binary Search tree and AVL Tree — unbalanced BST becoming a list.
ExDifference between Binary Search tree and AVL 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))

Difference between Binary Search tree and AVL Tree

Example

Short notes

Questions

Difference between Binary Search tree and AVL Tree

Example

Short notes

Questions