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 votes125 views1 answer
How to set chrome options python selenium for a folder
Python
4 votes129 views1 answer
Python spawn shell
Python
1 vote125 views1 answer
Python remove none from dict
Python
0 vote172 views1 answer
Access django server from another machine
Python Django
0 vote112 views1 answer
Pyjone location
Python
5 votes122 views2 answers
Merge dictionaries in python
Python
8 votes126 views2 answers
Python create list of specific length
Python
0 vote131 views1 answer
Plt add y gridlines
Python
12 votes132 views6 answers
Tkinter
Python
8 votes127 views5 answers
Convert integer to binary in python
Python