Question: write a C++ program to Implement the following functionalities for a 2-3 tree: - add to a 2-3 tree - remove from a 2-3 tree
write a C++ program to Implement the following functionalities for a 2-3 tree:
- add to a 2-3 tree
- remove from a 2-3 tree
- Traverse a 2-3 tree in-order
- search a 2-3 tree
Test your program on the following:
add(5)
add(40)
add(10)
add(20)
add(15)
add(30)
add(3)
add(4)
traverse()
remove(10)
traverse()
searchFor(20)
searchFor(33)
Make sure to include the print screen of all of your output (all testing cases)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
