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

3 votes299 views4 answers
Convert from python to javascript online
Python
6 votes274 views1 answer
Copy file in python3
Python
0 vote256 views1 answer
Pandas astype str still object
Python
3 votes275 views2 answers
Map dataframe
Python
0 vote256 views2 answers
Insert character into string at position x python
Python
2 votes251 views1 answer
How to make an empty variable in python
Python
0 vote259 views1 answer
Jupyter upload folder
Python
2 votes282 views2 answers
Iterate through attributes of class python
Python
2 votes339 views2 answers
Python !=
Python
0 vote274 views4 answers
How to see directory from os module
Python