-
Notifications
You must be signed in to change notification settings - Fork 1k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
8a76956
commit 445f8b2
Showing
1 changed file
with
64 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,64 @@ | ||
#Class which represents a node of binary tree | ||
class Node: | ||
def __init__(self,key): | ||
self.left = None | ||
self.right = None | ||
self.val = key | ||
|
||
#Function which add a key to binary tree | ||
def insert(root,node): | ||
if root is None: | ||
root = node | ||
else: | ||
if root.val < node.val: | ||
if root.right is None: | ||
root.right = node | ||
else: | ||
insert(root.right, node) | ||
else: | ||
if root.left is None: | ||
root.left = node | ||
else: | ||
insert(root.left, node) | ||
#Function to do inorder tree traversal | ||
def inorder(root): | ||
if root: | ||
inorder(root.left) | ||
print(root.val) | ||
inorder(root.right) | ||
|
||
#Function for searching a key in the tree | ||
def search(root,key): | ||
|
||
# Base Cases: root is null or key is present at root | ||
if root is None: | ||
return False | ||
elif root.val == key: | ||
return True | ||
|
||
# Key is greater than root's key | ||
if root.val < key: | ||
return search(root.right,key) | ||
|
||
# Key is smaller than root's key | ||
return search(root.left,key) | ||
|
||
|
||
#Test case | ||
|
||
r = Node(50) | ||
insert(r,Node(30)) | ||
insert(r,Node(20)) | ||
insert(r,Node(40)) | ||
insert(r,Node(70)) | ||
insert(r,Node(60)) | ||
insert(r,Node(80)) | ||
|
||
print "Result of traversing" | ||
inorder(r) | ||
|
||
|
||
print "Is 25 in the tree?", search(r,25) | ||
print "Is 30 in the tree?", search(r,30) | ||
print "Is 2 in the tree?", search(r,2) | ||
|