How do I insert and delete nodes in a binary search tree?

How do I insert and delete nodes in a binary search tree?

To insert a node, start at the root and compare the value. If it's smaller, go left; if larger, go right. Repeat until you find a null spot.

What if I want to delete a node that has two children?

In that case, you need to find the node's in-order successor (the smallest node in the right subtree) or in-order predecessor (the largest node in the left subtree) to replace it.

Can you give me an example of inserting and deleting nodes?

Sure! If you insert 5, 3, and 7 into an empty BST, it looks like this: 5 is the root, 3 is left, and 7 is right. To delete 5, replace it with 7.

What are the time complexities for these operations?

Both insertion and deletion operations have an average time complexity of O(log n) but can degrade to O(n) in the worst case for unbalanced trees.