Function to search the key in a particular level of the tree .
def binarySearch ( root : Node , start : int , end : int , data : int , level : int ) -> bool : NEW_LINE INDENT if ( end >= start ) : NEW_LINE DEDENT