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

1 vote190 views1 answer
Python KeyError: 'kivy.garden.graph'
Python
1 vote187 views1 answer
Libreoffice add line in table
Python
0 vote187 views1 answer
Python split string into floats
Python
0 vote185 views1 answer
Python module to get football results
Python
0 vote211 views1 answer
No module named 'flask_jwt_extended'
Python Flask
0 vote198 views1 answer
How to subtract a day from a date?
Python
1 vote194 views1 answer
Change plot size matplotlib
Python
1 vote190 views2 answers
Python listen to keyboard input linux
Python
1 vote190 views1 answer
Tkinter new line in text
Python
1 vote186 views1 answer
Clibboard to png
Python