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

12 votes317 views2 answers
Python unresolved import vscode
Python
0 vote200 views3 answers
Short name in python
Python
1 vote191 views1 answer
New column with age interval pandas
Python
1 vote225 views1 answer
Set time complexity python
Python
-2 votes189 views3 answers
Convertir code python en java
Python
0 vote198 views1 answer
Create array with unknown size in python
Python
5 votes200 views1 answer
Python remove punctuation from text file
Python
0 vote190 views1 answer
Discord bot python time delay
Python
17 votes199 views4 answers
Python pil resize image
Python
1 vote196 views1 answer
Valueerror need more than 2 values to unpack findcontours
Python