Unlike we deal with various data access tools in real life like phone directory, dictionary, geographical map. In world of computer science we have various tools available in data structure. let us discuss various types of data-structure.
Array : Array are collections of data items of same type, stored together in continuous memory location. Each data item is known as "element". array are the most basic type of fundamental data structure. Arrays are linear data structure.
Graphs : Graph data structure contains data in the form of nodes and edges. each nodes connects each other by edges. graph is non-linear data structure.
Hash Tables : Hash-table is data-structure which stores data in key-value pair. this is structure normally builds internally using arrays. hash table maps keys to value. hash table non-linear data structure.
Linked List: Liked list data structure stores data in node, each node consist of data field and reference (address) of next node in list. it is a linear data-structure but does not require continuous memory location.
Stack : Stack data structure stores data in LIFO (Last In First Out) order, this is a linear data structure. it used the term push and pull while using. push is used to put data in stack and pull is used to retrieve data from stack.
Queue : Queue data structure stores data in FIFO (First In First Out) order, this is a linear data structure.
Tree : Tree stores data elements in hierarchal order. tree is multilevel data-structure that uses nodes. the bottom nodes call "leaf nodes" and top most node called as "root nodes". each nodes have reference (address) of next and previous nodes.
Trie : Not to be confused with a Tree, Tries are data structures that store strings like data items and are placed in a visual graph. Tries are also called keyword trees or prefix trees. Whenever you use a search engine and receive autosuggestions, you’re witnessing the trie data structure in action.
No comments:
Post a Comment