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 vote315 views1 answer
Introduction to sets python3
Python
0 vote322 views1 answer
How to import axes3D
Python
1 vote313 views1 answer
How to create routes in flask
Python
0 vote330 views2 answers
Sum two columns pandas
Python
0 vote299 views1 answer
Get length of a tuple in python
Python
0 vote302 views1 answer
How to add value in array django
Python
89 votes305 views6 answers
Requirements.txt python
Python
5 votes311 views1 answer
Check is lowercase
Python
0 vote296 views1 answer
Get number of zero is a row pandas
Python
24 votes445 views3 answers
Flask vs django
Python Flask