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

4 votes192 views1 answer
Python: change column name
Python
0 vote188 views1 answer
-bash: /usr/local/bin/python3: no such file or directory
Python
0 vote225 views1 answer
Django fixtures. To loaddata
Python Django
0 vote191 views1 answer
Django how to create superuser if does not exists on migration
Python
7 votes217 views6 answers
Install python 3 on mac
Python
0 vote183 views1 answer
Qtablewidget clear python
Python
3 votes168 views1 answer
Python set return type
Python
6 votes180 views1 answer
Pip freeze requirements.txt no weird path
Python
-1 vote168 views2 answers
How to apply lower string dataframe python
Python
0 vote216 views3 answers
Hashing in python
Python