def __init__(self,
val: int = 0,
left: 'Node' = None,
right: 'Node' = None,
next: 'Node' = None):
self.next = next
Node.__init__(self, value=val, left=left, right=right)
def __init__(self, parent, andGate=False, left=None, right=None, value=None, cost=0, id=0):
Node.__init__(self, value)
self.parent = parent
self.andGate = andGate
self.left = left
self.right = right
self.cost = cost
self.requirementid = id
self.nodeid = 0
def __init__(self, value):
Node.__init__(self, value)
self.size = 1
def __init__(self, val):
Node.__init__(self,val)
self.col=0
def __init__(self, val):
Node.__init__(self, val)
self.prob = Treap.gen_prob()
def __init__(self, value, left=None, right=None, parent=None):
Node.__init__(self, value, left=left, right=right)
if parent is not None and isinstance(parent, extNode):
self.__setattr__('parent', parent)
else:
self.__setattr__('parent', None)
def __init__(self, val):
Node.__init__(self, val)
self.parent = None
def __init__(self, val):
Node.__init__(self, val)
self.depth = 0
def __init__(self, val):
Node.__init__(self, val)
self.bfactor = 0
def __init__(self, value, data=None, left=None, right=None):
bNode.__init__(self, value, left, right)
if data:
self.data = data
else:
self.data = str(value)
def __init__(self, val):
Node.__init__(self, val)
self.height = 1
