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 vote344 views2 answers
Reading tsv file in python
Python
0 vote349 views1 answer
Extract a jar py
Python
0 vote335 views1 answer
Numpy randomly swap lines
Python
0 vote385 views1 answer
Python access class variable by string
Python
0 vote344 views1 answer
1d random walk in python stack exchange
Python
-2 votes337 views2 answers
Add colorbar to figure matplotlib line plots
Python
0 vote355 views1 answer
Array search with regex python
Python
0 vote347 views1 answer
Make screen shot of specific part of screen python
Python
0 vote379 views1 answer
Filter startswith django
Python Django
30 votes379 views6 answers
Get python version in code
Python