MShel

class Trie:
    trie = None

    END_WORD = '~END~'


    def __init__(self):
        self.trie = {}

    def add(self, word):

MShel

import random

def binarySearch(sortedArray: list, searchFor, prevMiddle = 0) ->int:
  middle = int(len(sortedArray)/2)
  if(sortedArray[middle] == searchFor):
    return prevMiddle + middle
  elif(sortedArray[middle] < searchFor):
    #should keep a track of left index of array
    prevMiddle += middle
    return binarySearch(sortedArray[middle:], searchFor, prevMiddle)