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

2 votes104 views4 answers
ValueError: Input contains NaN, infinity or a value too large for dtype('float32').
Python
8 votes126 views3 answers
Python clone object
Python
0 vote116 views1 answer
Create tiff stack in python
Python
1 vote108 views1 answer
How to take index first and last in python in one way
Python
-1 vote116 views1 answer
Mayeutica
Python
0 vote107 views1 answer
Python loop list from last to first
Python
0 vote110 views1 answer
Python function returning dictonary
Python
0 vote109 views1 answer
Python get ids from array of objects
Python
0 vote132 views1 answer
Django queryset to instance
Python Django
6 votes104 views1 answer
How to simulate a key press in python
Python