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 vote208 views1 answer
Python csv reader cast to float
Python
0 vote213 views1 answer
Exception Value: Object of type User is not JSON serializable
Python
4 votes204 views3 answers
Python remove everything after character
Python
1 vote202 views1 answer
Knowing the sum null values in a specific row in pandas dataframe
Python
4 votes218 views2 answers
Plt dashed line
Python
0 vote208 views1 answer
How to make images in python
Python
0 vote211 views1 answer
IsADirectoryError: [Errno 21] Is a directory: '/'
Python
8 votes196 views2 answers
Python using webbrowser
Python
1 vote229 views1 answer
How to use regex in a list
Python
1 vote216 views1 answer
Name 'glob' is not defined
Python