二叉树的操作代码:class Node: def init(self, data): self.data = data
self.left = None
self.right = Nonedef insert( root, data):
if root is None: return Node(data)
else:
if data <= root.data:
cur = insert(root.left, data)
二叉树的操作代码:class Node: def init(self, data): self.data = data
self.left = None
self.right = Nonedef insert( root, data):
if root is None: return Node(data)
else:
if data <= root.data:
cur = insert(root.left, data)