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 vote169 views1 answer
Numpy.ndarray' object has no attribute 'diff'
Python
1 vote165 views1 answer
How to merge dataframe with different keys
Python
0 vote159 views1 answer
Extract all namespace from xml file python
Python
0 vote163 views1 answer
Setting up Colab for Kaggle Downloads
Python
2 votes187 views1 answer
Argparse example python pyimagesearch
Python
0 vote171 views1 answer
Rotate image by specific angle opencv
Python
0 vote104 views6 answers
Assign dictionary a value from a list python
Python
0 vote183 views1 answer
Concatenating datfra,esin pandas
Python
4 votes180 views4 answers
Flash messages django
Python
5 votes159 views1 answer
Check if special character in string python
Python