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

2 votes168 views2 answers
Install ide python ubuntu
Python
2 votes105 views1 answer
Flask port number
Python
0 vote151 views1 answer
Smtp django
Python
1 vote142 views3 answers
Typeerror:
Python
0 vote153 views1 answer
Root = tk() python 3
Python
1 vote143 views1 answer
Install python3.6 in linux
Python
1 vote145 views1 answer
Test if character is number python string
Python
0 vote165 views1 answer
Open file find and replace commas python
Python
0 vote169 views1 answer
Then generate Django project from the project template of cookiecutter
Python
21 votes151 views2 answers
Fast api
Python