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 vote321 views1 answer
Fichier python pour brython
Python
15 votes311 views2 answers
Pandas get all rows with value
Python
0 vote396 views1 answer
How to export schema in graphene django
Python Django
0 vote292 views1 answer
Outlier removal
Python
110 votes293 views6 answers
Read text file in python
Python
48 votes417 views3 answers
Online matplotlib compiler
Python
0 vote314 views1 answer
Flask development mode
Python Flask
0 vote312 views1 answer
Inherit functions from other classes
Python
1 vote310 views2 answers
Python dictonary set default
Python
3 votes295 views6 answers
Squash commits git
Python