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 vote262 views1 answer
Read a number Print Fibonacci sequence up to the given number Python
Python
45 votes257 views6 answers
How to increase the figure size in matplotlib
Python
13 votes248 views3 answers
Permutation python
Python
9 votes273 views4 answers
Sklearn random forest
Python
0 vote267 views1 answer
Add comma to csv in pandas
Python
1 vote281 views1 answer
Save pythonpath
Python
0 vote265 views1 answer
Numpy index array all except
Python
6 votes271 views3 answers
How do i get parent directory python
Python
0 vote273 views1 answer
Python - Comment convertir le texte en discours
Python
24 votes243 views7 answers
Python timer
Python