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

1 vote135 views1 answer
Python validate url
Python
2 votes173 views1 answer
Matplotlib plot adjust margins
Python
0 vote139 views1 answer
Télécharger librairie avec pip
Python
4 votes137 views2 answers
Matplotlib plot title font size
Python
0 vote215 views1 answer
Getting multiple of 5 python
Python
26 votes146 views5 answers
Is_integer Python
Python
0 vote140 views3 answers
How to print a text in python
Python
0 vote135 views1 answer
Add dir to path python
Python
0 vote149 views1 answer
Python spacing problems
Python
0 vote143 views9 answers
Convert c++ to python online
Python