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

6 votes97 views2 answers
If file exist in folder then delete in python \
Python
0 vote140 views1 answer
Django queryset with multiple contain keyword
Python Django
7 votes111 views2 answers
Take input from clipboard python
Python
2 votes109 views1 answer
Tqdm progress bar python
Python
0 vote108 views1 answer
Pixmap in python
Python
-1 vote98 views1 answer
How to print memory address in python
Python
2 votes109 views2 answers
Can you edit string.punctuation
Python
0 vote132 views1 answer
How to return Fibbonaci(n) python
Python
6 votes109 views1 answer
Getting dummies and input them to pandas dataframe
Python
3 votes120 views1 answer
Lambda with two columns pandas
Python