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 vote277 views1 answer
Zip list to dictionary python
Python
0 vote269 views1 answer
How to make a instagram report bot python
Python
52 votes257 views6 answers
Python new line
Python
0 vote294 views1 answer
How i dynamically populate to CORS_ALLOWED_ORIGINS in django rest framework
Python Django
0 vote265 views1 answer
How to import api keys
Python
0 vote290 views1 answer
Spread dictionary python
Python
20 votes279 views2 answers
Create a list of a certain length python
Python
0 vote274 views1 answer
Installing python3.9 on linux mint 20
Python
0 vote274 views1 answer
Pandas view full dataframe
Python
0 vote257 views1 answer
How to get data in treeview in tkiter
Python