🗂️
Data Structures
  • Data Structures Manual
  • Arrays
    • Array ADT
    • Linear Search
    • Binary Search
    • Some More Basic Operations
    • Reversing an Array
    • Operations in a Sorted Array
    • Merging Two Arrays
    • Set Operations
    • Finding Missing Elements
    • Duplicates in an Array
    • Getting a Pair whose Sum = K
    • Finding Max & Min in Single Scan
  • Strings
    • Finding the Length of a String
    • Changing Cases in a String
    • Finding Number of Vowels, Consonants & Words
    • Reversing a String
    • Checking for Palindrome
    • Duplicates in a String
    • Checking if Strings are Anagrams
    • Permutations of a String
  • Singly Linked List
    • Displaying the Nodes
    • Counting the Nodes
    • Sum of all Nodes
    • Finding the Maximum Element
    • Searching in a Node
    • Inserting a Node
    • Inserting a Node in Sorted List
    • Deleting a Node
    • Checking if List is Sorted
    • Removing Duplicates from a List
    • Reversing a Linked List
    • Concatenating Two Lists
    • Detecting a Loop in Linked List
    • Merge Two Sorted Lists
    • Finding the Middle Node
  • Cirular Linked List
    • Displaying the Nodes
    • Inserting a Node
    • Deleting a Node
  • Doubly Linked List
    • Inserting a Node
    • Deleting a Node
    • Reversing a Doubly Linked List
    • Circular Doubly Linked List
  • Stack
    • Stack Using Array
    • Stack Using Linked List
    • Balancing Parenthesis
    • Infix to Postfix
    • Evaluation of Postfix Expression
  • Queue
    • Queue using Array
    • Queue using Linked List
    • Double Ended Queue
  • Binary Tree
    • Creating a Binary Tree using Queue
    • Recursive Tree Traversals
    • Iterative Tree Traversals
    • Level Order Traversal
    • Counting Nodes in a Binary Tree
    • Finding the Height of Tree
    • Finding Sum of All Nodes
  • Binary Search Tree
    • Searching in a BST
    • Inserting in a BST
    • Deleting in a BST
  • AVL Tree
    • Inserting in an AVL Tree
    • AVL Tree Rotations
    • Deleting in an AVL Tree
  • Heap
    • Inserting in a Heap
    • Deleting in a Heap
    • Heapify
Powered by GitBook
On this page
  • Is this guide good for beginners ? What if I have no experience with DS ?
  • I don't like the way everything is presented.
  • I want to add or modify something. How do I ?
  • I don't see any other languages apart from C.
  • Is it complete ?

Was this helpful?

Data Structures Manual

NextArray ADT

Last updated 5 years ago

Was this helpful?

DS Header Image

Is this guide good for beginners ? What if I have no experience with DS ?

Absolutely ! I would go as far as to say that this might the very thing that you might be looking for. I guess I have covered almost all the usual operations that could be performed on each data structure. There's procedure and code comments which tries to explain all the important steps. Give it a try !

I don't like the way everything is presented.

I want to add or modify something. How do I ?

Glad to hear that. You can make a pull request with your additions or changes. However, there's just one request. Do try to maintain the same style of file naming and layout of content. Proper credits will be given to each contributor, of course.

I don't see any other languages apart from C.

There isn't any other as of now. However, feel free to create a new branch for whichever language you want to contribute for. More content to be added soon.

Is it complete ?

Unfortunately, no. There's plenty of content which is not there in this repo currently. I will be adding content on trees, graphs and other data structures soon.

Like the initiative ? Give this repo a star or contribute to it. This is more than I can ask for.

To be honest, me neither ! So, here's the which has a better user experience in my opinion. There's no difference in the content. Just the UI.

GitBook Version