Jump to content

Category:Data structures

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 43.251.75.173 (talk) at 22:30, 5 April 2019. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer science, a data structure is a way of storing data in a computer so that it can be used efficiently. Often a carefully chosen data structure will allow a more efficient algorithm to be used. The choice of the data structure must begin from the choice of an abstract data structure.

See also

Data Structures Tutorial pradipMarch 31, 2019Data Structure Tutorials / DS Basics0 Comments Data Structures Tutorial Data Structures (DS) tutorial provides basic and advanced concepts of Data Structure. Our Data Structure tutorial is designed for beginners and professionals.

Data Structure is a way to store and organize data so that it can be used efficiently.

Our Data Structure tutorial includes all topics of Data Structure such as Array, Pointer, Structure, Linked List, Stack, Queue, Graph, Searching, Sorting, Programs, etc.

DS Tutorial


Data Structures Index DS Basics

DS Tutorial DS Introduction DS Algorithm Ds Asymptotic Analysis DS Pointer DS Structure DS Array

Array 2D Array DS Linked List

Linked List Insertion at beginning Insertion at end Insertion after specified node Deletion at beginning Deletion at end Deletion after specified node Traversing Searching Doubly Linked List Insertion at beginning Insertion at end Insertion after specified node Deletion at beginning Deletion at end Deletion of node having given data Traversing Searching Circular Linked List Insertion at beginning Insertion at end Deletion at beginning Deletion at the end Circular Doubly List Insertion at beginning Insertion at end Deletion at beginning Deletion at the end DS Stack

DS Stack Array Implementation Linked List Implementation DS Queue

DS Queue Array Implementation Linked List Implementation Circular Queue DS Tree

Tree Binary Tree Pre-order Traversal In-order Traversal Post-order Traversal Binary Search Tree Searching in BST Insertion in BST Deletion in BST AVL Tree Insertion in AVL Tree LL Rotation LR Rotation RL Rotation RR Rotation Deletion in AVL Tree B Tree B+ Tree Red Black Tree DS Graph

DS Graph Graph Implementation BFS Algorithm DFS Algorithm Spanning Tree Prim’s Algorithm Kruskal’s Algorithm DS Searching

Linear Search Binary Search DS Sorting

Bubble Sort Bucket Sort Comb Sort Counting Sort Heap Sort Insertion Sort Merge Sort Quick Sort Radix Sort Selection Sort Shell Sort Bitonic Sort Cocktail Sort Cycle Sort Tim Sort Interview Questions

DS Interview Questions