DSA · Theory

Find distance between two nodes of a Binary Search Tree

Theory

424/810

Find distance between two nodes of a Binary Search Tree

Meera only reaches for Find distance between two nodes of a Binary Search Tree when folder on disk has to stay correct in a file explorer.

Do Find distance between two nodes of a Binary Search Tree once by hand. left < root < right. Change one input. Say the new result out loud.

Skip Find distance between two nodes of a Binary Search Tree and unbalanced BST becoming a list shows up in a file explorer.

Use Find distance between two nodes of a Binary Search Tree when folder on disk must stay clear. If a simpler DSA step works, use that instead.

Find distance between two nodes of a Binary Search Tree trap: unbalanced BST becoming a list. Meera loses marks for that every viva.

Find distance between two nodes of a Binary Search Tree is not a lonely heading. Meera ties it to folder on disk.

One breath for Find distance between two nodes of a Binary Search Tree, then folder on disk, then unbalanced BST becoming a list. Sit down.

Diagram

Exam tip

Board: folder on disk. Dry-run Find distance between two nodes of a 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))

Find distance between two nodes of a Binary Search Tree — binary search halves a sorted array each step — O(log n).

Short notes

DefFind distance between two nodes of a Binary Search Tree — Meera uses it for folder on disk in a file explorer.
RuleFind distance between two nodes of a Binary Search Tree → left < root < right.
RememberFind distance between two nodes of a Binary Search Tree + time vs memory (a file explorer).
UseFind distance between two nodes of a Binary Search Tree in a file explorer (folder on disk).
TrapFind distance between two nodes of a Binary Search Tree — unbalanced BST becoming a list.
ExFind distance between two nodes of a 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))

Find distance between two nodes of a Binary Search Tree

Example

Short notes

Questions

Find distance between two nodes of a Binary Search Tree

Example

Short notes

Questions