Completed

BST Testing

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

Skills: C++ Programming

About the Client:
( 4 reviews ) Charlestown, United States

Project ID: #33848859

Awarded to:

Nikolas72

Hi, I have a great experience in algorithm. I can solve your problem in 1 hour. Due to my extensive knowledge in this area, I could complete the job quickly, easily and bug-free. Please contact me so we can discuss thi More

$30 USD in 1 day
(2 Reviews)
1.0

4 freelancers are bidding on average $35 for this job

esa59cfdec1d6569

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.

$30 USD in 1 day
(74 Reviews)
5.5
(4 Reviews)
2.2
torrikress2

*** Experiences in C++ and Algorithms*** Hi, Dear! I have a full experiences and knowledge in C++ and algorithms, so I can finish your work within next few hours. Hope to discuss with you soon. Thanks & Best regards! More

$50 USD in 1 day
(0 Reviews)
0.0