subramaniank

def search(inorder, instart, inend, key):
    for i in range(instart, inend+1):
        if inorder[i] == key:
            return i
    return None

def printPre(inorder, postorder, instart, inend, poststart, postend):
    if instart > inend or poststart > postend:
        return None

subramaniank

class TrieNode(object):

    def __init__(self, alphabet_size=26):
        self.value = 0
        self.alpha_size = alphabet_size
        self.children = [None for _ in range(self.alpha_size)]
        
    def leaf(self):
        return self.value != 0

subramaniank

def enum(*sequential, **named):
    enums = dict(zip(sequential, range(len(sequential))), **named)
    reverse = dict((value, key) for key, value in enums.iteritems())
    enums['reverse_mapping'] = reverse
    return type('Enum', (), enums)