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 vote147 views1 answer
Constructor python variables
Python
0 vote166 views1 answer
How to read file again in python
Python
89 votes146 views6 answers
Import csv file in python
Python
0 vote141 views1 answer
Discord.py autorole
Python
0 vote193 views1 answer
Networkx draw graph with weight
Python
0 vote153 views1 answer
Python - row slice dataframe by number of rows
Python
2 votes145 views1 answer
Save a dict to pickle
Python
3 votes147 views1 answer
Get all indices of a value in list python
Python
0 vote146 views2 answers
Try except in list comprehension
Python
1 vote149 views1 answer
Incognito mode in selenium
Python