2
请人帮助;我不认为我正确地遍历它,并且在它需要返回一个新列表时返回空。我被困了一段时间,仍然需要做所有其他的遍历。将为需要的输出提供单元测试,但我的单元测试可能是错误的。二叉树中序横向
def inorder(self):
print("in INOrDER is entered")
temp = [None]
if self.__left:
temp = temp.append(self.__left)
return self.__left.inorder()
elif self.__right:
temp = temp.append(self.__right)
return self.__right.inorder()
return temp
def test_inorder(self):
bt = family_tree()
bt.add(20, "melanie")
bt.add(10, "edwin")
bt.add(30, "junior")
bt.add(25, "dora")
bt.add(35, "kate")
x = bt.inorder()
expected = '''(10, 'edwin'),(20, 'melanie'),(25, 'dora'),(30, 'junior'),(35, 'kate')'''
self.assertEquals(str(x), expected)
t = family_tree(bt)
self.assertEquals(str(t), expected)
的可能的复制[二叉搜索树断面(http://stackoverflow.com/questions/37087182/binary-search-tree-transversals) – Gal