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 vote155 views1 answer
Python evaluate string
Python
0 vote170 views1 answer
Python - Comment vérifier une corde est vide
Python
4 votes207 views1 answer
Python 3.7 download for windows 7 32-bit
Python
0 vote220 views1 answer
Raise 400 error python
Python
0 vote204 views1 answer
Create fixtures django
Python
26 votes161 views5 answers
Display max rows pandas
Python
23 votes147 views4 answers
Python replace letters in string
Python
0 vote157 views1 answer
Get resource path python
Python
0 vote118 views0 answer
Python
11 votes177 views5 answers
Python discord mention user
Python