Write a program structure in C++ defined binary tree as below, where the item (content) in each node is a vector of strings.
struct TreeNode
{
vector<string> items;
TreeNode *left;
TreeNode *right;
};
Make a recursive function that checks if any of the nodes contain the string "nordea".
The function can be called like this:
bool hasString = myFunc(rootNode,"nordea");
Also with functions to insert, print and remove a node and values in the vector with test cases to show it works.
Hi, We are a group of Software Engineers. We have already have binary search tree implemented in C++ with us. We can assure you of quality work and originality. The project will be delivered on time.
Looking forward to your reply.
Regards,
Stax