1. Implement insert() in [login to view URL] and show the results of inserting 2, 1, 4, 5, 9, 3, 6, 7, 10, 12, 11 into an empty Binary search tree.
2. Start with the tree in problem 1 and implement delete_node() and do:
- delete 4, then
- delete 9.
3. Start with the tree in problem 2 and implement search() and do:
- Search 12
- Search 4
4 freelancers are bidding on average $35 for this job
Hi there, I checked your requirements and guarantee you it's gonna be done within the next few hours. Let's contact via chat so that I can start work immediately. Wish you the best.