Binary Search Tree

# Tree traversal in Python


class Node:
    def __init__(self, item):
        self.left = None
        self.right = None
        self.val = item


def inorder(root):

    if root:
        # Traverse left
        inorder(root.left)
        # Traverse root
        print(str(root.val) + "->", end='')
        # Traverse right
        inorder(root.right)


def postorder(root):

    if root:
        # Traverse left
        postorder(root.left)
        # Traverse right
        postorder(root.right)
        # Traverse root
        print(str(root.val) + "->", end='')


def preorder(root):

    if root:
        # Traverse root
        print(str(root.val) + "->", end='')
        # Traverse left
        preorder(root.left)
        # Traverse right
        preorder(root.right)


root = Node(1)
root.left = Node(2)
root.right = Node(3)
root.left.left = Node(4)
root.left.right = Node(5)

print("Inorder traversal ")
inorder(root)

print("\nPreorder traversal ")
preorder(root)

print("\nPostorder traversal ")
postorder(root)

Source: programiz.com

Similar codes

0 vote247 views3 answers
How to create a sub project in django
Python
0 vote335 views1 answer
Numpy randn with a shape of another array
Python
0 vote194 views1 answer
Onetomany field
Python
0 vote221 views1 answer
Python join list ignore none and empty string
Python
0 vote204 views1 answer
Python obtenir nom des fichiers d'un dossier
Python
2 votes194 views1 answer
Zippython
Python
0 vote228 views1 answer
K means image classification
Python
25 votes301 views10 answers
Translate
Python
50 votes176 views1 answer
Append to the start of a list python
Python
9 votes191 views6 answers
Add list python
Python