Skip to content

Category Archives: Advanced Data Structure

  We have discussed AVL insertion in the previous post. In this post, we will follow a similar approach for deletion.Steps to follow for deletion. To… Read More
AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for… Read More
In the previous post on trie we have described how to insert and search a node in trie. Here is an algorithm how to delete… Read More
  Trie is an efficient information reTrieval data structure. Using Trie, search complexities can be brought to optimal limit (key length). If we store keys… Read More
Let us solve the classic “fake coin” puzzle using decision trees. There are the two different variants of the puzzle given below. I am providing… Read More
Spaghetti stack A spaghetti stack is an N-ary tree data structure in which child nodes have pointers to the parent nodes (but not vice-versa) Spaghetti… Read More
An ordinary Doubly Linked List requires space for two address fields to store the addresses of previous and next nodes. It is represented as follows… Read More
Given a team of N players. How many minimum games are required to find second best player? We can use adversary arguments based on tournament… Read More