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

4 votes308 views2 answers
Setheading in python
Python
0 vote293 views1 answer
TypeError: can only concatenate str (not "method") to str
Python
12 votes336 views2 answers
Write number of lines in file python
Python
-4 votes319 views4 answers
Latest version of django
Python
0 vote308 views1 answer
Django admin readonly models
Python
2 votes325 views2 answers
Python include file
Python
9 votes325 views6 answers
Pattern in python
Python
3 votes321 views1 answer
Finding 2 decimal places python
Python
41 votes367 views4 answers
Python path filename
Python
0 vote317 views1 answer
Last 2 numbers of integer in python
Python