Python program to find an element in binary search tree.
Description:
This program is to find an element in binary search tree..
Algo: -
Program:1. Make a class for node in a tree.2. Form the tree by creating nodes.3. Traverse the tree.4. During traversal check the node one by one.5. If the node matches the searched value then return true.
#A class that represents the individual node of the Binary tree
class node:
def __init__(self, key):
self.left = None
self.right = None
self.data = key
#A function to count no. of nodes.
def finde(root,e,res):
if root:
if res==True:
return True
#First recur the left child
if root.left:
res=finde(root.left,e,res)
if root.data==e:
return True
#Recur the right child at last
if root.right:
res=finde(root.right,e,res)
return res
def main():
root = node(5) #root node of the tree
root.left = node(4) #node at left of root
root.right = node(6) #node at right of root
root.left.left = node(10)
root.right.left = node(12)
root.right.right =node(15)
e=int(input('Enter the element to be searched = '))
print(' ',root.data)
print(' / \\')
print(' ',root.left.data,' ',root.right.data)
print(' / / \\')
print(' ',root.left.left.data,' ',root.right.left.data,root.right.right.data)
var=finde(root,e,False)
if var==True:
print('Found')
else:
print('Not found')
#Driver code
if __name__ == "__main__":
main()
Enter the element to be searched = 6 5 / \ 4 6 / / \ 10 12 15 Found
Comments