Heaps

A Heap is a special Tree-based data structure in which the tree is a complete binary tree. In general, heaps are classified as:
  1. Max-Heap: In a Max-Heap the key present at the root node must be greatest among the keys present at all of its children. The same property must be recursively true for all sub-trees in that Binary Tree.
  2. Min-Heap: In a Min-Heap the key present at the root node must be minimum among the keys present at all of its children. The same property must be recursively true for all sub-trees in that Binary Tree.


Tries
A Trie is a special data structure used to store a group of strings letter by letter in the form of a tree with a maximum of 26 children on each node. the 26 pointers to children nodes represent the 26 letters on the alphabet. This data structure is usually used to represent the "Retrieval" of data, hence the name, Trie.
Strings are stored in a top to bottom manner on the basis of their prefix in a trie. All prefixes of length 1 are stored at until level 1, all prefixes of length 2 are sorted at until level 2 and so on.

Comments

Post a Comment

Popular posts from this blog

Learning Summary of 2019-2020 even Semester (Dimitri 2301870016)

Image
A link to the programming assignment :  here! Singly Linked List Singly Linked List   is a type of linked list in which each node has a link to the next one. The first node in a linked list is called a  Head  and is used as a point to find the rest of the linked list. Doubly Linked List Doubly linked list  (DLL)   is a type of linked list in which each node apart from storing its data has two links. The first link points to the previous node in the list and the second link points to the next node in the list. The first node of the list has its previous link pointing to NULL similarly the last node of the list has its next node pointing to NULL. Advantages vs singly linked list A DLL can be traversed in both forward and backward direction. The delete operation in DLL is more efficient if pointer to the node to be deleted is given. We can quickly insert a new node before a given node.   In singly linked list, to delete a node,...
Read more

Linked List

Image
Doubly Linked List Doubly linked list (DLL) is a type of linked list in which each node apart from storing its data has two links. The first link points to the previous node in the list and the second link points to the next node in the list. The first node of the list has its previous link pointing to NULL similarly the last node of the list has its next node pointing to NULL. Advantages vs singly linked list A DLL can be traversed in both forward and backward direction. The delete operation in DLL is more efficient if pointer to the node to be deleted is given. We can quickly insert a new node before a given node. In singly linked list, to delete a node, a pointer to the previous node is needed. To get this previous node, sometimes the list is traversed. In DLL, we can get the previous node using the “ previous ” pointer. Disadvantages vs singly linked list Every node of DLL require extra space for a previous pointer All operations require the “previous”...
Read more