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

1 vote205 views1 answer
How to become python developer
Python
0 vote171 views1 answer
Gaierror at /members/register [Errno 11001] getaddrinfo failed
Python
27 votes190 views6 answers
Delete spaces in string python
Python
2 votes229 views1 answer
What does * mean in python in functions
Python
31 votes191 views4 answers
Python remove nan rows
Python
0 vote199 views1 answer
Trim all new rows string python
Python
0 vote268 views1 answer
Stackoverflow python random forest
Python
5 votes180 views2 answers
Python calc days between dates
Python
9 votes186 views6 answers
Pattern program in python
Python
0 vote249 views1 answer
Python word cloud
Python