- HashTable
The Hash table data structure stores elements in key-value pairs where Key– unique integer that is used for indexing the values Value – data that are associated with keys. The key is sent to a hash function that performs arithmetic operations on it. The result (commonly called the hash value or…
- Graph
A graph data structure is a collection of nodes that have data and are connected to other nodes. Let’s try to understand this through an example. On facebook, everything is a node. That includes User, Photo, Album, Event, Group, Page, Comment, Story, Video, Link, Note…anything that has data is a…
- Trees
Tree is a data structure similar to a linked list but instead of each node pointing simply to the next node in a linear fashion, each node points to a number of nodes. Tree is an example of non- linear data structures. A tree structure is a way of representing the hierarchical nature of a […]
- Heap
Heap is a tree-based data structure in which all the nodes of the tree are in a specific order. Heap is a complete binary tree-based data structure. Heaps have specific ordering properties. The ordering can be one of two types: Max-Heap: The value of a node must be greater than or equal to the…
- CSS Introduction
CSS (Cascading Style Sheets) is used to style and lay out web pages — for example, to alter the font, color, size, and spacing of your content, split it into multiple columns, or add animations and other decorative features. It is a simple design language intended to simplify the process of making…