Search a node in BST Python

PROGRAM TO SEARCH A NOTE IN BINARY SEARCH TREE

class Node:

    def __init__(self, key):

        self.left = None

        self.right = None

        self.val = key

 

# A utility function to insert

# a new node with the given key

 

 

def insert(root, key):

    if root is None:

        return Node(key)

    else:

        if root.val == key:

            return root

        elif root.val < key:

            root.right = insert(root.right, key)

        else:

            root.left = insert(root.left, key)

    return root

 

# A utility function to do inorder tree traversal

 

 

def inorder(root):

    if root:

        inorder(root.left)

        print(root.val)

        inorder(root.right)

 

 

# Driver program to test the above functions

# Let us create the following BST

#    50

#  /     \

# 30     70

#  / \ / \

# 20 40 60 80

 

r = Node(50)

r = insert(r, 30)

r = insert(r, 20)

r = insert(r, 40)

r = insert(r, 70)

r = insert(r, 60)

r = insert(r, 80)

 

# Print inoder traversal of the BST

inorder(r)




OUTPUT:

20 
30 
40 
50 
60 
70 
80

CREDITS: https://www.geeksforgeeks.org/binary-search-tree-set-1-search-and-insertion/