{"version":1,"pages":[{"id":"-M1QxpVJeaQ-CqpYcyV7","title":"Data Structures Manual","pathname":"/data-structures","siteSpaceId":"sitesp_Q8ZQ5","description":""},{"id":"-M1QyKjOxt0KORQh_Jkh","title":"Array ADT","pathname":"/data-structures/arrays/array-adt","siteSpaceId":"sitesp_Q8ZQ5","description":"Implementation of append, insert, delete and display function in an array.","breadcrumbs":[{"label":"Arrays"}]},{"id":"-M1WTvxgkb_y_T8fn60C","title":"Linear Search","pathname":"/data-structures/arrays/linear-search","siteSpaceId":"sitesp_Q8ZQ5","description":"Implementation of linear search and methods to improve it","breadcrumbs":[{"label":"Arrays"}]},{"id":"-M1Wa9hWgA5yS79vM93X","title":"Binary Search","pathname":"/data-structures/arrays/binary-search","siteSpaceId":"sitesp_Q8ZQ5","description":"Implementation of binary search in array using iterative as well as recursive method.","breadcrumbs":[{"label":"Arrays"}]},{"id":"-M1_tpcYnNgE79aexYGV","title":"Some More Basic Operations","pathname":"/data-structures/arrays/some-more-basic-operations","siteSpaceId":"sitesp_Q8ZQ5","description":"The get, set, min, max, sum and average operations.","breadcrumbs":[{"label":"Arrays"}]},{"id":"-M1a2GIXXcjHlguTul05","title":"Reversing an Array","pathname":"/data-structures/arrays/reversing-an-array","siteSpaceId":"sitesp_Q8ZQ5","description":"Implementation of 2 of the methods which can be used to reverse an array.","breadcrumbs":[{"label":"Arrays"}]},{"id":"-M1a8OGeFcKEUyXByopm","title":"Operations in a Sorted Array","pathname":"/data-structures/arrays/operations-in-a-sorted-array","siteSpaceId":"sitesp_Q8ZQ5","description":"Inserting in a sorted array, checking if an array is sorted and shifting negative elements to the left of array.","breadcrumbs":[{"label":"Arrays"}]},{"id":"-M1aS4UpUYsclM4ME9Ej","title":"Merging Two Arrays","pathname":"/data-structures/arrays/merging-two-arrays","siteSpaceId":"sitesp_Q8ZQ5","description":"Implementation of Merge Algorithm","breadcrumbs":[{"label":"Arrays"}]},{"id":"-M1b3ivXth_64aiS6bU4","title":"Set Operations","pathname":"/data-structures/arrays/set-operations","siteSpaceId":"sitesp_Q8ZQ5","description":"Implementation of set operations like union, intersection, difference and set membership.","breadcrumbs":[{"label":"Arrays"}]},{"id":"-M1f6NPxMOmqEbZnuyyT","title":"Finding Missing Elements","pathname":"/data-structures/arrays/finding-missing-elements","siteSpaceId":"sitesp_Q8ZQ5","description":"Methods to find one or more missing elements in an array.","breadcrumbs":[{"label":"Arrays"}]},{"id":"-M1jxbxELqcWmq-gjGc1","title":"Duplicates in an Array","pathname":"/data-structures/arrays/duplicates-in-an-array","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to find and count duplicates in an array.","breadcrumbs":[{"label":"Arrays"}]},{"id":"-M1k8_AKeEpEAXrzza39","title":"Getting a Pair whose Sum = K","pathname":"/data-structures/arrays/getting-a-pair-whose-sum-k","siteSpaceId":"sitesp_Q8ZQ5","description":"Obtaining a pair of elements in the array whose sum = k.","breadcrumbs":[{"label":"Arrays"}]},{"id":"-M1kfR1y3_OsJ5AeIx1i","title":"Finding Max & Min in Single Scan","pathname":"/data-structures/arrays/finding-max-and-min-in-single-scan","siteSpaceId":"sitesp_Q8ZQ5","description":"Implementation for finding the maximum and minimum element in an array in a single scan itself.","breadcrumbs":[{"label":"Arrays"}]},{"id":"-M1pQrewYlATYNECqor4","title":"Finding the Length of a String","pathname":"/data-structures/strings/finding-the-length-of-a-string","siteSpaceId":"sitesp_Q8ZQ5","description":"Implementation for finding the length of a string without library functions.","breadcrumbs":[{"label":"Strings"}]},{"id":"-M3Gsyeg6E1Cii4fgGM_","title":"Changing Cases in a String","pathname":"/data-structures/strings/changing-cases-in-a-string","siteSpaceId":"sitesp_Q8ZQ5","description":"ASCII values and it's importance in changing cases in a string.","breadcrumbs":[{"label":"Strings"}]},{"id":"-M3H-r34xVKctHW7PvOb","title":"Finding Number of Vowels, Consonants & Words","pathname":"/data-structures/strings/finding-number-of-vowels-consonants-and-words","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"Strings"}]},{"id":"-M3HEuFHFfsZnJrzuMJv","title":"Reversing a String","pathname":"/data-structures/strings/reversing-a-string","siteSpaceId":"sitesp_Q8ZQ5","description":"Implementation of reversing a string without using library function.","breadcrumbs":[{"label":"Strings"}]},{"id":"-M3H_eS9v0bUxEYgyeY1","title":"Checking for Palindrome","pathname":"/data-structures/strings/checking-for-palindrome","siteSpaceId":"sitesp_Q8ZQ5","description":"An efficient way of checking if a string is a palindrome.","breadcrumbs":[{"label":"Strings"}]},{"id":"-M3Mm7TfDV91CtQDMVT4","title":"Duplicates in a String","pathname":"/data-structures/strings/duplicates-in-a-string","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"Strings"}]},{"id":"-M3QNrs6AZgB5KMSs9sO","title":"Checking if Strings are Anagrams","pathname":"/data-structures/strings/checking-if-strings-are-anagrams","siteSpaceId":"sitesp_Q8ZQ5","description":"Strings which are composed of the same alphabets and their frequency are known as anagrams of each other.","breadcrumbs":[{"label":"Strings"}]},{"id":"-M3QC2E3GyBCBOiTKiuM","title":"Permutations of a String","pathname":"/data-structures/strings/permutations-of-a-string","siteSpaceId":"sitesp_Q8ZQ5","description":"Finding all the permutations of a string using backtracking and recursion.","breadcrumbs":[{"label":"Strings"}]},{"id":"-M3aFbAf1deAGkPfv4KA","title":"Displaying the Nodes","pathname":"/data-structures/linked-list/displaying-the-nodes","siteSpaceId":"sitesp_Q8ZQ5","description":"Iterative and recursive method to print all the nodes in a linked list.","breadcrumbs":[{"label":"Singly Linked List"}]},{"id":"-M3aJuXikXkHqOdxwDw4","title":"Counting the Nodes","pathname":"/data-structures/linked-list/counting-the-nodes","siteSpaceId":"sitesp_Q8ZQ5","description":"Iterative and recursive way of counting the number of nodes in a linked list.","breadcrumbs":[{"label":"Singly Linked List"}]},{"id":"-M3aSsLtY42Ct3WdkHv-","title":"Sum of all Nodes","pathname":"/data-structures/linked-list/sum-of-all-nodes","siteSpaceId":"sitesp_Q8ZQ5","description":"Iterative and recursive way of finding the sum of data of all the nodes in a linked list.","breadcrumbs":[{"label":"Singly Linked List"}]},{"id":"-M3aUqSSlwcFAXEmf_Xc","title":"Finding the Maximum Element","pathname":"/data-structures/linked-list/finding-the-maximum-element","siteSpaceId":"sitesp_Q8ZQ5","description":"Iterative and recursive way of finding the maximum among all the node's data.","breadcrumbs":[{"label":"Singly Linked List"}]},{"id":"-M3aaGuVjhEuknzftHal","title":"Searching in a Node","pathname":"/data-structures/linked-list/searching-in-a-node","siteSpaceId":"sitesp_Q8ZQ5","description":"Iterative and recursive implementation of linearly searching for an element in a linked list.","breadcrumbs":[{"label":"Singly Linked List"}]},{"id":"-M3fkpg4d-Rcp2Kgpq4n","title":"Inserting a Node","pathname":"/data-structures/linked-list/inserting-a-node","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to insert a new node in the beginning, end or at a specific position in the linked list.","breadcrumbs":[{"label":"Singly Linked List"}]},{"id":"-M3g6QExNjHZiENA00Je","title":"Inserting a Node in Sorted List","pathname":"/data-structures/linked-list/inserting-a-node-in-sorted-list","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to insert a new node in a sorted linked list.","breadcrumbs":[{"label":"Singly Linked List"}]},{"id":"-M3pJfI-r5oJ1nri0Gvf","title":"Deleting a Node","pathname":"/data-structures/linked-list/deleting-a-node","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to delete a node from any position in a linked list.","breadcrumbs":[{"label":"Singly Linked List"}]},{"id":"-M3ptNITTZGvGahENnGc","title":"Checking if List is Sorted","pathname":"/data-structures/linked-list/checking-if-list-is-sorted","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to check if a linked list is sorted or not.","breadcrumbs":[{"label":"Singly Linked List"}]},{"id":"-M3puDNrEHWwAvOS2giU","title":"Removing Duplicates from a List","pathname":"/data-structures/linked-list/removing-duplicates-from-a-list","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to remove duplicate nodes from a linked list.","breadcrumbs":[{"label":"Singly Linked List"}]},{"id":"-M3zwORqmYKzm1R8IPoo","title":"Reversing a Linked List","pathname":"/data-structures/linked-list/reversing-a-linked-list","siteSpaceId":"sitesp_Q8ZQ5","description":"Iterative and recursive approaches to reverse a linked list.","breadcrumbs":[{"label":"Singly Linked List"}]},{"id":"-M4-4nOX5xOE6yzkHIgb","title":"Concatenating Two Lists","pathname":"/data-structures/linked-list/concatenating-two-lists","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to concatenate two linked lists.","breadcrumbs":[{"label":"Singly Linked List"}]},{"id":"-M4-8dEIRdPUR-4LAFlI","title":"Detecting a Loop in Linked List","pathname":"/data-structures/linked-list/detecting-a-loop-in-linked-list","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to check if a given list has a loop using Floyd's Cycle Finding Algorithm.","breadcrumbs":[{"label":"Singly Linked List"}]},{"id":"-M4-a6ZKfLJDaWWEIJZ_","title":"Merge Two Sorted Lists","pathname":"/data-structures/linked-list/merge-two-sorted-lists","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to merge two sorted linked lists.","breadcrumbs":[{"label":"Singly Linked List"}]},{"id":"-M4Oj6Cm6rWyMv5cegGf","title":"Finding the Middle  Node","pathname":"/data-structures/linked-list/finding-the-middle-node","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to find the middle node of a singly linked list.","breadcrumbs":[{"label":"Singly Linked List"}]},{"id":"-M4EHI41gkW9eM206t2l","title":"Displaying the Nodes","pathname":"/data-structures/cirular-linked-list/displaying-the-nodes","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to display all the nodes in a circular linked list.","breadcrumbs":[{"label":"Cirular Linked List"}]},{"id":"-M4ELtbCArUgwtVbMQfW","title":"Inserting a Node","pathname":"/data-structures/cirular-linked-list/inserting-a-node","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to insert a node at a given index in a circular linked list.","breadcrumbs":[{"label":"Cirular Linked List"}]},{"id":"-M4EPHNGQKn31t4y2oAS","title":"Deleting a Node","pathname":"/data-structures/cirular-linked-list/deleting-a-node","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to remove a node from a given position in a circular linked list.","breadcrumbs":[{"label":"Cirular Linked List"}]},{"id":"-M4E_hQxQ1MLChpD8DuK","title":"Inserting a Node","pathname":"/data-structures/doubly-linked-list/inserting-a-node","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to insert in node in doubly linear linked list.","breadcrumbs":[{"label":"Doubly Linked List"}]},{"id":"-M4JaRdeEeD4p5VNkJGG","title":"Deleting a Node","pathname":"/data-structures/doubly-linked-list/deleting-a-node","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to delete a node at a given index in a doubly linear linked list.","breadcrumbs":[{"label":"Doubly Linked List"}]},{"id":"-M4JfLzs5eFd8_gL6jhD","title":"Reversing a Doubly Linked List","pathname":"/data-structures/doubly-linked-list/reversing-a-doubly-linked-list","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to reverse a doubly linear linked list.","breadcrumbs":[{"label":"Doubly Linked List"}]},{"id":"-M4K-_bHAAaorgkgyHwX","title":"Circular Doubly Linked List","pathname":"/data-structures/doubly-linked-list/circular-doubly-linked-list","siteSpaceId":"sitesp_Q8ZQ5","description":"Basic operations for a circular doubly linked list.","breadcrumbs":[{"label":"Doubly Linked List"}]},{"id":"-M51VUt6EgeaAn8mW_Cc","title":"Stack Using Array","pathname":"/data-structures/stack/stack-using-array","siteSpaceId":"sitesp_Q8ZQ5","description":"Complete implementation of a stack using array and its functions.","breadcrumbs":[{"label":"Stack"}]},{"id":"-M51ZJtHBxPZYjzfVGbN","title":"Stack Using Linked List","pathname":"/data-structures/stack/stack-using-linked-list","siteSpaceId":"sitesp_Q8ZQ5","description":"Implementation of a stack using linked list and its functions.","breadcrumbs":[{"label":"Stack"}]},{"id":"-M58mMcY6CAZfGFRieIo","title":"Balancing Parenthesis","pathname":"/data-structures/stack/balancing-parenthesis","siteSpaceId":"sitesp_Q8ZQ5","description":"A program to check if the parenthesis are balanced in an equation.","breadcrumbs":[{"label":"Stack"}]},{"id":"-M58tDw1yZ3l2f-12rac","title":"Infix to Postfix","pathname":"/data-structures/stack/infix-to-postfix","siteSpaceId":"sitesp_Q8ZQ5","description":"Program to convert an infix expression to a postfix expression.","breadcrumbs":[{"label":"Stack"}]},{"id":"-M58urpNxoPlntU5qvAQ","title":"Evaluation of Postfix Expression","pathname":"/data-structures/stack/evaluation-of-postfix-expression","siteSpaceId":"sitesp_Q8ZQ5","description":"Procedure to evaluate a postfix expression using stack.","breadcrumbs":[{"label":"Stack"}]},{"id":"-M5KxQX-G1Sat3oZhFXJ","title":"Queue using Array","pathname":"/data-structures/queue/queue-using-array","siteSpaceId":"sitesp_Q8ZQ5","description":"Implementation of queue using arrays and its functions.","breadcrumbs":[{"label":"Queue"}]},{"id":"-M5LWL57i4jsXyVGvz13","title":"Queue using Linked List","pathname":"/data-structures/queue/queue-using-linked-list","siteSpaceId":"sitesp_Q8ZQ5","description":"Implementation of queue using a linked list.","breadcrumbs":[{"label":"Queue"}]},{"id":"-M5LlfzgQd9aa3Oko3cY","title":"Double Ended Queue","pathname":"/data-structures/queue/double-ended-queue","siteSpaceId":"sitesp_Q8ZQ5","description":"Implementation of double ended queue using linked list","breadcrumbs":[{"label":"Queue"}]},{"id":"-M7CsLAqg1sUf0FRixis","title":"Creating a Binary Tree using Queue","pathname":"/data-structures/binary-tree/creating-a-binary-tree-using-queue","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"Binary Tree"}]},{"id":"-M7DAZCTny-AgAGYQJl5","title":"Recursive Tree Traversals","pathname":"/data-structures/binary-tree/recursive-tree-traversals","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"Binary Tree"}]},{"id":"-M7DEMGIKocuKuTCDQr8","title":"Iterative Tree Traversals","pathname":"/data-structures/binary-tree/iterative-tree-traversals","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"Binary Tree"}]},{"id":"-M7Ddfls0D9tfCTSoe-f","title":"Level Order Traversal","pathname":"/data-structures/binary-tree/level-order-traversal","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"Binary Tree"}]},{"id":"-M7DjBDTJ6nYuU7n50Ny","title":"Counting Nodes in a Binary Tree","pathname":"/data-structures/binary-tree/counting-nodes-in-a-binary-tree","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"Binary Tree"}]},{"id":"-M7Dsgi577sxDMUdc1dA","title":"Finding the Height of Tree","pathname":"/data-structures/binary-tree/finding-the-height-of-tree","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"Binary Tree"}]},{"id":"-M7DtoXgejTGcQrZ-hnL","title":"Finding Sum of All Nodes","pathname":"/data-structures/binary-tree/finding-sum-of-all-nodes","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"Binary Tree"}]},{"id":"-M7HPLGhS2gzUOS1cKxk","title":"Searching in a BST","pathname":"/data-structures/binary-search-tree/searching-in-a-bst","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"Binary Search Tree"}]},{"id":"-M7HZM2kdPsdeit802ya","title":"Inserting in a BST","pathname":"/data-structures/binary-search-tree/inserting-in-a-bst","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"Binary Search Tree"}]},{"id":"-M7JFm3R_5zwM7kiggSg","title":"Deleting in a BST","pathname":"/data-structures/binary-search-tree/deleting-in-a-bst","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"Binary Search Tree"}]},{"id":"-M7XjhOKZWQUEpIXAp8-","title":"Inserting in an AVL Tree","pathname":"/data-structures/avl-tree/inserting-in-an-avl-tree","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"AVL Tree"}]},{"id":"-M7Xtffe3NCFNS-bCPxH","title":"AVL Tree Rotations","pathname":"/data-structures/avl-tree/avl-tree-rotations","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"AVL Tree"}]},{"id":"-M7rKqaRjQ1lQAFLzsJj","title":"Deleting in an AVL Tree","pathname":"/data-structures/avl-tree/deleting-in-an-avl-tree","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"AVL Tree"}]},{"id":"-M8A0U3Zl1rlQKvPFTAI","title":"Inserting in a Heap","pathname":"/data-structures/heap/inserting-in-a-heap","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"Heap"}]},{"id":"-M8A5FLE5G_IPZ9uOtus","title":"Deleting in a Heap","pathname":"/data-structures/heap/deleting-in-a-heap","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"Heap"}]},{"id":"-M8AgGg7DirJhCNAKBQE","title":"Heapify","pathname":"/data-structures/heap/heapify","siteSpaceId":"sitesp_Q8ZQ5","description":"","breadcrumbs":[{"label":"Heap"}]}]}