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

214 votes368 views6 answers
Python loop through dictionary
Python
0 vote158 views1 answer
Open link in tab new trong selenium python
Python
0 vote167 views1 answer
Python array of last n months
Python
5 votes158 views6 answers
Python dictionary comprehension
Python
0 vote152 views1 answer
Python string lower method
Python
26 votes154 views5 answers
Display max rows pandas
Python
0 vote192 views1 answer
Import pil pycharm
Python
0 vote159 views2 answers
How to download file in python
Python
0 vote142 views1 answer
How to join an array of characters in python
Python
-1 vote159 views2 answers
Generate bar plot python
Python