python二叉树问题

Python015

python二叉树问题,第1张

def __init__(self ,value=3): # value = default_value

self.value = value

这样就行了撒。

PS:以后贴代码记得把缩进对齐。。。

class Node(object):

def __init__(self, value):

self.left = None

self.right = None

self.value = value

class MyBST(object):

def __init__(self):

self.empty = True

def add(self, value):

if self.empty:

self.root = Node(value)

self.empty = False

cur = self.root

while (True):

if not cur:

cur = Node(value)

break

if value >cur.value:

if cur.value != None:

cur = cur.right

else:

newNode = Node(value)

cur.right = newNode

break

elif value <cur.value:

if cur.value != None:

cur = cur.left

else:

newNode = Node(value)

cur.left = newNode

break

else:

cur.value = value

break

在while(True)循环里添加一个if条件判断