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

20 votes328 views1 answer
ParserError: Error tokenizing data. C error: Expected 1 fields in line 87, saw 2
Python
0 vote370 views1 answer
Python how to code discord bot kick members
Python
3 votes348 views2 answers
How to find if user input is lower case or upper case in python
Python
14 votes320 views2 answers
Python tim script
Python
3 votes328 views1 answer
Parentheses balancer python
Python
0 vote328 views1 answer
Pandas groupby without reset index
Python
0 vote318 views2 answers
I want to check my python code online
Python
7 votes362 views2 answers
Trim multiple spaces in python
Python
0 vote360 views1 answer
AttributeError: module 'django.db.models' has no attribute 'ArrayField'
Python Django
-4 votes331 views5 answers
Current django version
Python Django