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 vote249 views1 answer
Calculer un temps en python
Python
0 vote252 views3 answers
Type object 'datetime.datetime' has no attribute 'timedelta'
Python
-1 vote255 views2 answers
How to measure how much your of cpu your program is using in python
Python
0 vote237 views1 answer
Python cache return value
Python
0 vote227 views1 answer
Pytest suppress errors
Python
1 vote235 views1 answer
Subprocess the system cannot find the file specified
Python
0 vote242 views1 answer
Py array contains
Python
0 vote237 views1 answer
How to write a first program in machine learning
Python
0 vote258 views1 answer
Dataframe how to substruct 2 dates
Python
3 votes245 views2 answers
Plot second y axis matplotlib
Python