Hello,

I am trying to implement a show traversal binary search tree in C++ I'm having so much trouble implementing the showTraversal function. Its not working and I keep getting some errors, when I don't get errors, it does not do what its suppose to.

* The data structure of a binary search tree node struct BSTNode { int key: BSTNode* left = 0; BSTNode* right = 0; }; //Initialized to NULL //Initialized to NULL #define BST_MAX_SIZE 100 Defines a binary search tree traversal data structure struct BST Traversal { int keys[BST_MAX_SIZE]: int size = 0; }; 1 @functionality :- //Loop through traversal keys and print each key on the screen separated by spaces. 277 278 279 280 281 282 283 284 285 286 287 288 289 290 void showTraversal (const BSTTraversal& traversal) { for (int i = 0; i