Trie – Prefix Tree

Youtube Video and Java Code(add, search, delete) Gist(add, search, frequency). I'm making a search engine called MillionGazillion from Interview Cake.  First we can use a hash table. This though takes a lot of space.  To prevent that we use a Trie(though it has it's own memory issues but hey it's better here). One way would be…

Binary Search Tree(BST)

Sort elements by frequency | Set 2 Binary Search Tree Visualizer Set to question  Set of question link - 2 K'th Largest element in a BST (Code) same as  Binary Search Tree in reverse inorder (Python Code to print BST in reverse) Find all the leave node. -  this logic is useful in the next question Check whether BST contains…