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

7 votes97 views2 answers
Python print variables and string
Python
0 vote115 views1 answer
Dataframe fill none
Python
0 vote99 views1 answer
Python lastmonth
Python
18 votes108 views2 answers
Open an exe file using python
Python
-1 vote105 views1 answer
Restricting user access to web pages
Python
1 vote89 views2 answers
Perfect number in python
Python
0 vote107 views1 answer
Say hello to someone in python
Python
0 vote99 views1 answer
Python ceil method
Python
-1 vote129 views1 answer
Raw query in django
Python Django
2 votes103 views1 answer
Downgrade python 3.8 to 3.7 ubuntu
Python