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 vote139 views1 answer
Python max of two numbers
Python
3 votes136 views1 answer
Corr pandas
Python
0 vote144 views1 answer
How to make a nice login django form
Python
8 votes141 views3 answers
Join dataframe pandas by column
Python
9 votes138 views2 answers
How to read video in opencv python
Python
19 votes138 views1 answer
Turn off warnings
Python
8 votes146 views4 answers
Glob
Python
15 votes170 views3 answers
Inverse matrix python
Python
2 votes136 views2 answers
Python replace first
Python
1 vote104 views1 answer
How to use pca using scikit learn
Python