Traversing a tree in python

"""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

Source: tutorialspoint.com

Traversing a tree in python

"""Post-order"""
    def postorder_traversal(self, root):
        res = []

        if root:
            res = self.predorder_traversal(root.left)
            res = res + self.predorder_traversal(root.right)
            res.append(root.data)
        return res

Similar codes

5 votes345 views2 answers
Python how to put int into list
Python
17 votes325 views6 answers
Int to list python
Python
0 vote345 views1 answer
How to insert item at specifc index python
Python
0 vote337 views1 answer
Spacy create tokenizer
Python
0 vote324 views1 answer
Gyp err! stack error: command failed: c:\python39\python.exe -c import sys; print "%s.%s.%s" % sys.version_info[:3];
Python
57 votes462 views6 answers
How to make a class in python
Python
0 vote360 views1 answer
To the power python markdown
Python
0 vote373 views1 answer
Imshow show nan as black
Python
0 vote397 views1 answer
Maximum count of replacements in python
Python
0 vote410 views1 answer
Read tar.gz file python
Python