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

5 votes243 views1 answer
Fetch row where column is equal to a value pandas
Python
-1 vote239 views1 answer
Python unicode point to utf8 string
Python
1 vote249 views1 answer
How to print whole year calendar in python
Python
1 vote258 views1 answer
Python dict to url params
Python
0 vote252 views3 answers
Pandas replace nulls with zeros
Python
0 vote254 views1 answer
Selenium without a browser
Python
1 vote247 views1 answer
Display data from database in django
Python
4 votes284 views1 answer
Django objects.create()
Python Django
0 vote269 views1 answer
Python get filename from path glob without extension
Python
0 vote282 views1 answer
System to extract data from csv file in python
Python