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 vote149 views1 answer
Python django os error
Python
2 votes130 views1 answer
Matplotlib multiple plots with different size
Python
0 vote131 views1 answer
Create new column pandas and order sequence
Python
6 votes131 views4 answers
Print all elements in list python
Python
-1 vote280 views1 answer
Combination of 1 2 3 4 5 python
Python
0 vote114 views1 answer
Foreign key django createview
Python
6 votes135 views6 answers
Best ide for python
Python
111 votes116 views6 answers
Rename columns
Python
-1 vote131 views1 answer
Returns a new DataFrame containing the distinct rows in this DataFrame
Python
7 votes85 views1 answer
Telegram markdown
Python