Einen Baum in Python durchqueren
"""Inorder Traversing"""
def inorder_traversing(self, root):
res = []
if root:
res = self.inorder_traversing(root.left)
res.append(root.data)
res = res + inorder_traversing(root.right)
return res
Relieved Raccoon