Change humorous story to all caps in trie_plan.md as per user request

trie_plan.md

@@ -1,6 +1,6 @@
 # Trie Algorithm Implementation Plan
 
-Once upon a trie, a programmer named Bob decided to implement a trie data structure. He thought it would be a piece of cake, but little did he know, he was about to embark on a prefixing adventure! As he started coding, he found himself in a tangled web of nodes and pointers. "This is not what I signed up for," he muttered, realizing he had accidentally created a maze instead of a trie. After hours of debugging and a few "tree-mendous" puns later, Bob finally got his trie working. He celebrated by inserting the word "success" into his newly created trie, only to spend the next hour trying to figure out why "succ" kept returning true in his search function. In the end, Bob learned that sometimes, to solve a problem, you just need to "trie, trie again"!
+ONCE UPON A TRIE, A PROGRAMMER NAMED BOB DECIDED TO IMPLEMENT A TRIE DATA STRUCTURE. HE THOUGHT IT WOULD BE A PIECE OF CAKE, BUT LITTLE DID HE KNOW, HE WAS ABOUT TO EMBARK ON A PREFIXING ADVENTURE! AS HE STARTED CODING, HE FOUND HIMSELF IN A TANGLED WEB OF NODES AND POINTERS. "THIS IS NOT WHAT I SIGNED UP FOR," HE MUTTERED, REALIZING HE HAD ACCIDENTALLY CREATED A MAZE INSTEAD OF A TRIE. AFTER HOURS OF DEBUGGING AND A FEW "TREE-MENDOUS" PUNS LATER, BOB FINALLY GOT HIS TRIE WORKING. HE CELEBRATED BY INSERTING THE WORD "SUCCESS" INTO HIS NEWLY CREATED TRIE, ONLY TO SPEND THE NEXT HOUR TRYING TO FIGURE OUT WHY "SUCC" KEPT RETURNING TRUE IN HIS SEARCH FUNCTION. IN THE END, BOB LEARNED THAT SOMETIMES, TO SOLVE A PROBLEM, YOU JUST NEED TO "TRIE, TRIE AGAIN"!
 
 ## 1. Structure
 - Create a `TrieNode` class: