假设我有节点类:class Node:
def __init__(self, data, link=None):
self.data = data
self.link = link
class BTNode:
def __init__(self, item, left=None, right=None):
self.item = item
self.left = left
self.right = right
我想创建一个二叉搜索树的顺序遍历的链表。在
到目前为止,我得到的是:
^{pr2}$
测试:if __name__ == '__main__':
a1 = BTNode('A')
a2 = BTNode('B')
a3 = BTNode('C')
a4 = BTNode('D')
a5 = BTNode('G')
a6 = BTNode('E')
a7 = BTNode('F')
a1.left = a2
a1.right = a3
a2.right = a4
a4.left = a5
a3.left = a6
a3.right = a7
x = inorder(a1)
但是我得到了一个错误:
UnboundLocalError:赋值前引用了局部变量“left_head”
如果我做了一些类似的事情:def _inorder(root):
if root is None:
return None, None
else:
temp = Node(root.item)
#if root.left:
left_head, left_tail = _inorder(root.left)
left_tail.link = temp
#if root.right:
right_head, right_tail = _inorder(root.right)
temp.link = right_head
return left_head, right_tail
然后错误变成:NoneType'object没有属性'link'
因为我认为我的逻辑是正确的,所以有人能看出问题所在吗。在