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 vote222 views1 answer
Update set python
Python
69 votes235 views6 answers
Python dictionary append
Python
1 vote224 views1 answer
Listas en python
Python
5 votes246 views2 answers
Python 3 replace all whitespace characters
Python
1 vote216 views1 answer
Pandas write to csv without first line
Python
26 votes224 views6 answers
Flask run
Python
-1 vote236 views1 answer
Class views django slug
Python
0 vote258 views1 answer
Next function with inherited list python
Python
10 votes235 views1 answer
Pandas select columns where value is true
Python
1 vote234 views1 answer
Python check if is pandas dataframe
Python