# algorithm of red black tree

from tree_node import TreeNode

class RedBlackTree:
    def __init__(self, array=None):
        self.__root = None
        self.__create_tree(array)

    def __create_tree(self, array):
        if not array or len(array) == 0:
            return None

        self.__root = TreeNode(array[0])
        temp = list()
        temp.append(self.__root)
        for i in range(1, len(array)):
            if not array[i]:
                continue
            node = TreeNode(array[i])
            if int(i%2) == 1:
                parent = temp[int(i/2)]
                parent.left = node
            else:
                parent = temp[int(i/2)-1]
                parent.right = node
            temp.append(node)

    def insert(self, value):
        pass

    def delete(self, value):
        pass

    def search(self, value):
        pass

    def size(self):
        pass