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 vote131 views3 answers
RegExp numéro français
Python
4 votes126 views2 answers
Uuid regex
Python
2 votes132 views2 answers
Forrest Gump
Python
3 votes138 views1 answer
Label size matplotlib
Python
3 votes138 views2 answers
Iterating string in python
Python
0 vote130 views1 answer
Proper function pandas
Python
8 votes145 views2 answers
Discord python get member object by id
Python
0 vote130 views1 answer
Reference other libraries in library
Python
0 vote135 views1 answer
Santhal paragana
Python
0 vote89 views1 answer
FunÃ§Ã£o anonima python
Python