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 vote349 views1 answer
Python class tostring
Python
0 vote338 views1 answer
Import sqlite to mysql django
Python
3 votes398 views1 answer
Django group by
Python Django
4 votes315 views5 answers
Del list python
Python
1 vote328 views1 answer
Python Pandas pivot on bin
Python
2 votes352 views1 answer
Radio button pyqt
Python
0 vote344 views1 answer
How do you see if a data type is an integer python
Python
3 votes402 views3 answers
Run a shell script from python
Python
2 votes376 views1 answer
Python string argument without an encoding
Python
0 vote348 views1 answer
Password protected mongo server
Python