DSA · Theory

Find kth Smallest Element in a Binary Search Tree

Theory

322/810

Find kth Smallest Element in a Binary Search Tree

Find kth Smallest Element in a Binary Search Tree is a DSA topic. In plain words you use it for folder on disk in a file explorer. Don’t start with a slogan — start with that picture.

Smallest example: left < root < right. Type it, run it, and say what you see. If you can do that from memory, you know Find kth Smallest Element in a Binary Search Tree.

From the example next to this theory: Find kth Smallest Element in a Binary Search Tree — binary search halves a sorted array each step — O(log n).

Trap — unbalanced BST becoming a list. Fix that before you talk about advanced DSA.

Viva — what is Find kth Smallest Element in a Binary Search Tree? Then show left < root < right. Then name the trap.

Diagram

Exam tip

What is Find kth Smallest Element in a Binary Search Tree? Show this: left < root < right. 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 kth Smallest Element in a Binary Search Tree — binary search halves a sorted array each step — O(log n).

Short notes

DefFind kth Smallest Element in a Binary Search Tree — folder on disk in a file explorer.
Ruleleft < root < right
Trapunbalanced BST becoming a list
Usea file explorer

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 kth Smallest Element in a Binary Search Tree

Example

Short notes

Questions

Find kth Smallest Element in a Binary Search Tree

Example

Short notes

Questions