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 vote178 views1 answer
Python string to list new line
Python
1 vote169 views1 answer
Django update increment
Python
0 vote184 views1 answer
Django prepopulated_fields
Python
0 vote195 views1 answer
How to import flask restful using pip
Python Flask
0 vote203 views2 answers
How to make python faster than c++
Python
2 votes186 views3 answers
Selenium find element by link text python
Python
14 votes166 views1 answer
Python cheat sheet pdf download
Python
0 vote176 views1 answer
How to add a under line of the button in tkinter python
Python
0 vote201 views1 answer
Purpose of migration folder in django
Python Django
0 vote186 views1 answer
How to pull images from android device from usb in python
Python