Need help implementing void completions_recurse(string x, string* suggestions, Node* root) on my .cpp on the header below the suedocode for it can be found on how to do recursevly

Binary-tree-based Autocompleter.

-Store words in a binary search tree (using BST insert)

-Compute size of dictionary (using recursive tree traversal)

-Find smallest 5 completions (using recursive tree traveral)

From my .cpp

#include using namespace std; class Autocompleter public: // Same as hwAC1 Autocompleter); void insert (string x); I/ a.k.a. add() int size() void completions (string x, string* suggestions); private: // A helper class that implements // a basic binary search tree node. class Node public: Node(string s)