A binary search algorithm allows you to search an ordered list of elements using divide and conquer strategy. But before we dive in, lets have a gentle reminder of a linear search. Whats linear se...

I attended a meet up the other day and found myself working on a task that involved the websocket protocol. I haven’t used it much before and thought it would be a good opportunity to explore a sma...

Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target. If there is no such subarray, return 0 ...

Question Validate if a binary tree satisifies the binary search tree property. Example: Valid BST flowchart TD 8((8)) --> 3((3)) 8((8)) --> 10((10)) 3((3)) --> 1((1)) 3(...

Write a function that takes in a root, value as arguments and returns the root with the new node inserted into the correct position of the binary search tree. class Node: def __init__(self, d...

Given two binary search trees root1 and root2, return a list containing all the integers from both trees sorted in ascending order. Full question details here. # Definition for a binary tree node...

Let’s start with a quick definition: The property of a binary search tree is that the left child is always less than the current node and the right child is always greater than the current node. ...

Question Given a binary tree, find the number of nodes it contains. Consider the following input: flowchart TD 2((2)) --> 7((7)) 7((7)) --> 4((4)) 7((7)) --> 6((6)) 2((2)) ...

Question Write an algorithm that traverses the binary tree in reverse order from the bottom level to the top level. Consider the example: flowchart TD 2((2)) --> 7((7)) 7((7)) --> 4((...

Question Given a binary tree, write a recursive algorithm to find the height of the tree. class Node: def __init__(self, value) -> None: self.value = value self.left = No...