C++ Binary Tree with vector<string> data.

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.