2D-Array TRIE Implementation - Need help in testing

Greetings community,
I was surfing the web for some sleek 2D-Array Trie implementation, but unfortunately i was not able to find anything that could satisfy my needs. (if there is any, please let me know in the comments)

So, I decided to code it myself. I have tried a few test cases myself to check if did work accurately, for which it did. But obviously, I feel it requires much more testing, and if anyone is free to test it, please test and let me know the results! :slight_smile:
A huge thanks in advance!!!

pastebin link to my code: #include<bits/stdc++.h>using namespace std;#define SPEED ios:: - Pastebin.com
It supports the following operations:

  1. insert
  2. erase
  3. search
  4. pref_search

Regards
vrishinvv

Why not submit it to some online simple problems like this and know yourself if it is correct ?

yup, working on that simultaneously, thanks for the tip :slight_smile: