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

11 votes258 views1 answer
Selecting items in a column of a dataframe
Python
0 vote247 views1 answer
The dropping of sediment by water wind and ice or gravity is known as
Python
0 vote245 views1 answer
How to create list from a to z in python
Python
0 vote251 views1 answer
Python convert strings to chunks
Python
95 votes264 views6 answers
Check if string contains python
Python
-2 votes243 views1 answer
Python check set empty
Python
1 vote251 views1 answer
Python - Comment chiffrer une boucle
Python
-2 votes264 views1 answer
En_core_web_sm
Python
0 vote288 views3 answers
Pandas assign multiple columns at once
Python
1 vote276 views1 answer
What is nea in python
Python