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

34 votes202 views5 answers
Remove substring python
Python
0 vote206 views1 answer
Neopixel thonny python
Python
0 vote228 views1 answer
Fastest way to Convert Integers to Strings in Pandas DataFrame
Python
0 vote273 views1 answer
Python install minio
Python
0 vote250 views1 answer
Python os is directory
Python
9 votes183 views2 answers
Fill missing values in column pandas with mean
Python
-1 vote216 views1 answer
How to remove an element from dictionary using his value python
Python
0 vote184 views1 answer
Get py version
Python
0 vote218 views1 answer
Fibonacci logic in pthon in for loop
Python
11 votes223 views3 answers
How to get a specific character in a string on number python
Python