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

105 votes108 views5 answers
Input pythhon
Python
1 vote98 views1 answer
Find all text in site python
Python
7 votes101 views1 answer
Python primality test
Python
1 vote113 views1 answer
Python program for swapping position of two numbers
Python
0 vote161 views1 answer
Valor absoluto en python
Python
1 vote129 views1 answer
Django httpresponseredirect
Python Django
3 votes111 views1 answer
Get column number in dataframe pandas
Python
5 votes120 views2 answers
Python pie chart
Python
0 vote125 views2 answers
Completely uninstall python and all vritualenvs from mac
Python
0 vote61 views1 answer
Print single pixel from numpy
Python