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 vote185 views1 answer
Pandas read google sheet
Python
1 vote234 views1 answer
Install chromedriver ubuntu python
Python
13 votes239 views5 answers
Finding the maximum value in a list python
Python
0 vote183 views1 answer
Quoto x discord selfbot
Python
0 vote259 views1 answer
ImportError: cannot import name 'MigrateCommand' from 'flask_migrate'
Python Flask
0 vote201 views2 answers
I type nano in python and o get error
Python
0 vote208 views1 answer
Blender show python version
Python
0 vote186 views1 answer
How to add window background in pyqt5
Python
0 vote197 views2 answers
Python faculty of 0 is 1 faculty of 1 is 1
Python
0 vote184 views1 answer
Print start time in python
Python