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 vote208 views1 answer
Python control browse mouse selenium
Python
0 vote203 views2 answers
Wxpython menu callback stackoverflow
Python
0 vote192 views1 answer
Create array with shape 0,2
Python
0 vote190 views1 answer
How to access item in list private in python
Python
-1 vote192 views1 answer
Code error correction
Python
0 vote194 views1 answer
Kinesis Client get_records example
Python
0 vote231 views1 answer
Pipenv installs
Python
3 votes188 views1 answer
How to use threading in pyqt5
Python
8 votes190 views3 answers
Python gzip file
Python
1 vote655 views1 answer
Pandas dataframe convert yes no to 0 1
Python