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

2 votes315 views1 answer
How to write a numpy array to a file in python
Python
1 vote166 views1 answer
Extract url from page python
Python
58 votes160 views6 answers
Python list sum
Python
1 vote195 views2 answers
How to download more languages for pyttsx3
Python
0 vote274 views1 answer
Add_signal_handler
Python
1 vote194 views1 answer
Convert period to timestamp pandas
Python
8 votes159 views1 answer
Count the duplicates in a list in python
Python
0 vote211 views1 answer
Django MESSAGE_TAGS
Python Django
1 vote166 views1 answer
Python singleton
Python
3 votes228 views2 answers
Python sum only numbers
Python