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 vote200 views1 answer
Python floor float
Python
0 vote260 views1 answer
Getting the Current Working Directory in Python
Python
4 votes264 views2 answers
Count characters in string python
Python
0 vote231 views1 answer
Integers come in all sizes solution in python3
Python
8 votes224 views4 answers
Print pandas version
Python
22 votes226 views4 answers
Python is float
Python
0 vote237 views1 answer
Returns all column names as a list
Python
0 vote211 views1 answer
While my_input != "exit":
Python
0 vote214 views2 answers
Atoi in python code
Python
2 votes217 views1 answer
Tqdm progress bar python
Python