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 vote169 views1 answer
Google-api-python-client python 3
Python
0 vote165 views1 answer
Pygame mixer documentation
Python
0 vote171 views2 answers
Set environment variable heroku django
Python
5 votes198 views2 answers
If list item is found in string get that item python
Python
0 vote167 views1 answer
Extra import on django
Python
1 vote218 views1 answer
Python install required packages
Python
-1 vote168 views2 answers
How to upgrade bash on mac
Python
0 vote167 views1 answer
Matplotlib tick label position left and right x axis
Python
0 vote141 views2 answers
Pandas filter rows by fuzzy values
Python
1 vote183 views2 answers
Convert column to timestamp pandas
Python