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