AI coding assistant for busy programmers

All

JavaScript

make a binary search tree algorithm in Python

Python

# Binary Search Tree Algorithm in Python

class Node: 
	def __init__(self, data): 
		self.data = data 
		self.left = None
		self.right = None

def insert(root, node):

if root is None: 
		root = node

else:

# if the data of the node to be inserted is smaller than the root's data then it will be inserted in the left subtree of the root node  
		if root.data > node.data:

# if left is None then insert the new node here  
            if root.left is None: 
                root.left = node

# if left is not None then recur until an empty place is found  
            else: 
                insert(root.left, node)

# if the data of the node to be inserted is greater than the root's data then it will be inserted in the right subtree of the root node  
        else:

# if right is None then insert the new node here  
            if root.right is None: 
                root.right = node

# if right is not None then recur until an empty place is found  
            else: 
                insert(root.right, node)

🤖 Code Explanation

def inorder(root):

if root:
inorder(root.left)
print(root.data)
inorder(root.right)

def search(root, key):

if root is None or root.data == key:
return root

if root.data < key:
return search(root.right, key)

return search(root.left, key)

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))

inorder(r)

x = search(r, 20

AI coding assistant for busy programmers

make a binary search tree algorithm in Python

Python

🤖 Code Explanation

More problems solved in Python