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 vote309 views1 answer
How to draw squircle python
Python
0 vote242 views0 answer
Python
-1 vote276 views1 answer
Create close python program in puthon
Python
0 vote293 views1 answer
How to run multiple python files one after another
Python
0 vote293 views2 answers
Python difference between multiprocessing Pool and Threadpool
Python
0 vote290 views1 answer
Python reference parent module
Python
3 votes312 views1 answer
Webcam cv2
Python
0 vote300 views1 answer
12000000/12
Python
5 votes298 views1 answer
UnicodeDecodeError: 'charmap' codec can't decode byte 0x9e in position 3359: character maps to <undefined>
Python
0 vote311 views1 answer
Pytorch older versions
Python