Algos Cheat Sheet

def bsearch(arr, target):
    left, right = 0, len(arr) - 1
    while left <= right:
        mid = (left + right) // 2
        val = arr[mid]
        if val == target:
            return mid
        elif val > target:
            right = mid - 1
        else:
            left = mid + 1
    return -1

import heapq

def heap_min(arr):
    heapq.heapify(arr)
    return arr[0]

def heap_max(arr):
    heaparr = []
    for val in arr:
        heapq.heappush(heaparr, -1 * val)
    return -1 * heaparr[0]

def dfs(root, target):
    def search(node):
        if not node:
            return

        if node.val == target:
            return node

        left = search(node.left)
        if left:
            return left

        right = search(node.right)
        if right:
            return right

    return search(root)

def bfs(root, target):
    queue = [root]
    while queue:
        node = queue.pop()
        if not node:
            continue
        if node.val == target:
            return node

        queue.append(node.left)
        queue.append(node.right)
    return None