{"version":1,"pages":[{"id":"-MkNnoJ5IECLlFdTIFSG","title":"Data Structures and Algorithms","pathname":"/data-strutures-and-algorithms/main","siteSpaceId":"sitesp_0VZ9x","description":""},{"id":"-MkNnoIHnN2s2_qmr8gw","title":"Algorithms Analysis","pathname":"/data-strutures-and-algorithms/main/algorithms-analysis","siteSpaceId":"sitesp_0VZ9x","description":""},{"id":"-MkNnoIITVTr1qlONhu2","title":"Measuring Resource Consumption","pathname":"/data-strutures-and-algorithms/main/algorithms-analysis/measuring-resource-consumption","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Algorithms Analysis"}]},{"id":"-MkNnoIJ5CikIOZ81Yxa","title":"Growth Rates","pathname":"/data-strutures-and-algorithms/main/algorithms-analysis/growth-rates","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Algorithms Analysis"}]},{"id":"-MkNnoIKBwd9IxegFNSh","title":"Asymptotic Notation","pathname":"/data-strutures-and-algorithms/main/algorithms-analysis/big-o-little-o-theta-omega-notation","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Algorithms Analysis"}]},{"id":"-MkNnoILNuD_LtyCcCfl","title":"Analysis of Linear Search","pathname":"/data-strutures-and-algorithms/main/algorithms-analysis/analysis-of-linear-search","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Algorithms Analysis"}]},{"id":"-MkNnoIMJLAo4iF8ySVf","title":"Analysis of Binary Search","pathname":"/data-strutures-and-algorithms/main/algorithms-analysis/analysis-of-binary-search","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Algorithms Analysis"}]},{"id":"-MkNnoINOYso56-u3xle","title":"How to do an analysis in 5 steps","pathname":"/data-strutures-and-algorithms/main/algorithms-analysis/how-to-do-an-analysis-in-5-steps","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Algorithms Analysis"}]},{"id":"-MkNnoIO5KhzTmGKsv0u","title":"Recursion","pathname":"/data-strutures-and-algorithms/main/recursion","siteSpaceId":"sitesp_0VZ9x","description":""},{"id":"-MkNnoIP7FoVJ0IKWrCm","title":"Writing a recursive function","pathname":"/data-strutures-and-algorithms/main/recursion/how-to-write-a-recursive-function","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Recursion"}]},{"id":"-MkNnoIQmBrYsJ6OzZBh","title":"How do recursive functions work?","pathname":"/data-strutures-and-algorithms/main/recursion/how-do-recursive-functions-work","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Recursion"}]},{"id":"-MkNnoIRnmUHxnuRAXCJ","title":"Analysis of a Recursive Function","pathname":"/data-strutures-and-algorithms/main/recursion/analysis-of-a-recursive-function","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Recursion"}]},{"id":"-MkNnoISUHXmgE0W-x5l","title":"Drawbacks of Recursion and Caution","pathname":"/data-strutures-and-algorithms/main/recursion/drawbacks-of-recursion-and-caution","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Recursion"}]},{"id":"-MkNnoITBgjVGp3o0nya","title":"Lists","pathname":"/data-strutures-and-algorithms/main/lists","siteSpaceId":"sitesp_0VZ9x","description":""},{"id":"-MkNnoIUdE4_cO5jMQj_","title":"Implementation","pathname":"/data-strutures-and-algorithms/main/lists/implementation","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Lists"}]},{"id":"-MkNnoIVM3gBZ9RyQ1_F","title":"Linked List","pathname":"/data-strutures-and-algorithms/main/lists/linked-list","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Lists"}]},{"id":"-MkNnoIWVXq3eQ4Cfulc","title":"Concepts","pathname":"/data-strutures-and-algorithms/main/lists/linked-list/implementation","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Lists"},{"label":"Linked List"}]},{"id":"-MkNnoIXEsosAyY22VTX","title":"Implementation - List and Nodes","pathname":"/data-strutures-and-algorithms/main/lists/linked-list/implementation-list-and-nodes","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Lists"},{"label":"Linked List"}]},{"id":"-MkNnoIYN197dyxUyU69","title":"Implementation - push_front(), pop_front()","pathname":"/data-strutures-and-algorithms/main/lists/linked-list/c++-implementation","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Lists"},{"label":"Linked List"}]},{"id":"-MkNnoIZeGhxz-_59717","title":"Implementation - Iterators","pathname":"/data-strutures-and-algorithms/main/lists/linked-list/implementation-iterators","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Lists"},{"label":"Linked List"}]},{"id":"-MkNnoI_h30HM91TVFyg","title":"Modification - Sentinel Nodes","pathname":"/data-strutures-and-algorithms/main/lists/linked-list/modification-sentinel-nodes","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Lists"},{"label":"Linked List"}]},{"id":"-MkNnoIa_aLSf-e_dbwA","title":"Stacks and Queues","pathname":"/data-strutures-and-algorithms/main/stacks-and-queues","siteSpaceId":"sitesp_0VZ9x","description":""},{"id":"-MkNnoIbsSn8qkwx15DI","title":"Stack Implementation","pathname":"/data-strutures-and-algorithms/main/stacks-and-queues/stack-implementation","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Stacks and Queues"}]},{"id":"-MkNnoIcKjAe5thQfUug","title":"Queue Implementation","pathname":"/data-strutures-and-algorithms/main/stacks-and-queues/queue-implementation","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Stacks and Queues"}]},{"id":"-MkNnoIdoggHrMLUoSNl","title":"Table","pathname":"/data-strutures-and-algorithms/main/table","siteSpaceId":"sitesp_0VZ9x","description":""},{"id":"-MkNnoIewNt6JPWoQdzB","title":"A Simple Implementation","pathname":"/data-strutures-and-algorithms/main/table/a-simple-implementation","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Table"}]},{"id":"-MkNnoIfsEToyOEC0SZ4","title":"Hash Tables","pathname":"/data-strutures-and-algorithms/main/table/hash-tables","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Table"}]},{"id":"-MkNnoIg6t54O0stHQkn","title":"Bucketing","pathname":"/data-strutures-and-algorithms/main/table/hash-tables/bucketing","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Table"},{"label":"Hash Tables"}]},{"id":"-MkNnoIhdQuNBIR_WJjj","title":"Chaining","pathname":"/data-strutures-and-algorithms/main/table/hash-tables/chaining","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Table"},{"label":"Hash Tables"}]},{"id":"-MkNnoIimXmZZsbOYs-6","title":"Linear Probing","pathname":"/data-strutures-and-algorithms/main/table/hash-tables/untitled-1-2","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Table"},{"label":"Hash Tables"}]},{"id":"-MkNnoIjWHyFqOLsaodq","title":"Sorting","pathname":"/data-strutures-and-algorithms/main/sorting","siteSpaceId":"sitesp_0VZ9x","description":""},{"id":"-MkNnoIk2Q2NbmUnjwGq","title":"Simple Sorts","pathname":"/data-strutures-and-algorithms/main/sorting/simple-sorts","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Sorting"}]},{"id":"-MkNnoIlOWY2I5DIvZ46","title":"Bubble Sort","pathname":"/data-strutures-and-algorithms/main/sorting/simple-sorts/the-simple-sorts","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Sorting"},{"label":"Simple Sorts"}]},{"id":"-MkNnoImdpXFaZmDZ01M","title":"Insertion Sort","pathname":"/data-strutures-and-algorithms/main/sorting/simple-sorts/insertion-sort","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Sorting"},{"label":"Simple Sorts"}]},{"id":"-MkNnoInb9eCth120ssW","title":"Selection Sort","pathname":"/data-strutures-and-algorithms/main/sorting/simple-sorts/selection-sort","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Sorting"},{"label":"Simple Sorts"}]},{"id":"-MkNnoIoYWfDLEAPLOIn","title":"Merge Sort","pathname":"/data-strutures-and-algorithms/main/sorting/merge-sort","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Sorting"}]},{"id":"-MkNnoIppGqfR8xNKzAs","title":"Quick Sort","pathname":"/data-strutures-and-algorithms/main/sorting/quick-sort","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Sorting"}]},{"id":"-MkNnoIq2H9o-6LrjsiS","title":"Heap and Heap Sort","pathname":"/data-strutures-and-algorithms/main/sorting/heap-and-heap-sort","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Sorting"}]},{"id":"-MkNnoIrmCyHW1lD5ubw","title":"Priority Queues using Binary Heaps","pathname":"/data-strutures-and-algorithms/main/sorting/heap-and-heap-sort/priority-queues-using-binary-heaps","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Sorting"},{"label":"Heap and Heap Sort"}]},{"id":"-MkNnoIsXlVzvRpfvT5V","title":"Heapify and Heap Sort","pathname":"/data-strutures-and-algorithms/main/sorting/heap-and-heap-sort/heap-sort","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Sorting"},{"label":"Heap and Heap Sort"}]},{"id":"-MkNnoItTJjZbH61aA-c","title":"Trees","pathname":"/data-strutures-and-algorithms/main/definitions","siteSpaceId":"sitesp_0VZ9x","description":""},{"id":"-MkNnoIu2HOIbmtug9bH","title":"Binary Trees","pathname":"/data-strutures-and-algorithms/main/definitions/tree-implementation","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Trees"}]},{"id":"-MkNnoIvtYQ1ZNm7Ax4H","title":"Binary Search Trees","pathname":"/data-strutures-and-algorithms/main/definitions/binary-search-trees","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Trees"}]},{"id":"-MkNnoIwmYp160nhsgS5","title":"BST Implemenation","pathname":"/data-strutures-and-algorithms/main/definitions/linked-list-implementation","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Trees"}]},{"id":"-MkNnoIxz_CW0s9iqNE2","title":"Iterative Methods","pathname":"/data-strutures-and-algorithms/main/definitions/implementation-of-bst","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Trees"}]},{"id":"-MkNnoIyAxYmn_jYzKoV","title":"Recursive Methods","pathname":"/data-strutures-and-algorithms/main/definitions/recursive-methods","siteSpaceId":"sitesp_0VZ9x","description":"","breadcrumbs":[{"label":"Trees"}]},{"id":"-MkNnoIzAdNPVhVFqklA","title":"AVL Trees","pathname":"/data-strutures-and-algorithms/main/avl-trees","siteSpaceId":"sitesp_0VZ9x","description":""},{"id":"-MkNnoJ-5CJsOWc1ONJR","title":"Red Black Trees","pathname":"/data-strutures-and-algorithms/main/red-black-trees","siteSpaceId":"sitesp_0VZ9x","description":""},{"id":"-MkNnoJ0trFw4E0IcI55","title":"2-3 Trees","pathname":"/data-strutures-and-algorithms/main/2-3-trees","siteSpaceId":"sitesp_0VZ9x","description":""},{"id":"-MkNnoJ11DhHZD23gACu","title":"Graphs","pathname":"/data-strutures-and-algorithms/main/graphs","siteSpaceId":"sitesp_0VZ9x","description":""},{"id":"-MkNnoJ24oMoXzM14oG6","title":"Introduction to Computational Theory","pathname":"/data-strutures-and-algorithms/main/theory-of-computation","siteSpaceId":"sitesp_0VZ9x","description":""},{"id":"-MkNnoJ3QAVF3O19TndQ","title":"Appendix: Markdown","pathname":"/data-strutures-and-algorithms/main/appendix-markdown","siteSpaceId":"sitesp_0VZ9x","description":""},{"id":"-MkNnoJ4_DxfvigHCw5l","title":"Appendix: Mathematics Review","pathname":"/data-strutures-and-algorithms/main/untitled","siteSpaceId":"sitesp_0VZ9x","description":""},{"id":"-LFrWzErlr2J_PJFMeuB","title":"Data Structures and Algorithms","pathname":"/data-strutures-and-algorithms","siteSpaceId":"sitesp_i5xuc","description":""},{"id":"-LGTM98twf_ozYf2z5Ny","title":"Algorithms Analysis","pathname":"/data-strutures-and-algorithms/algorithms-analysis","siteSpaceId":"sitesp_i5xuc","description":""},{"id":"-LGYd1eRkfW4fpdZYXoI","title":"Measuring Resource Consumption","pathname":"/data-strutures-and-algorithms/algorithms-analysis/measuring-resource-consumption","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Algorithms Analysis"}]},{"id":"-LGVcHQe13GzqJrP-bQ8","title":"Growth Rates","pathname":"/data-strutures-and-algorithms/algorithms-analysis/growth-rates","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Algorithms Analysis"}]},{"id":"-LGVcbzhvFF_cHRIpkpc","title":"Asymptotic Notation","pathname":"/data-strutures-and-algorithms/algorithms-analysis/big-o-little-o-theta-omega-notation","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Algorithms Analysis"}]},{"id":"-LGY6S3XX3ke2CFi77j4","title":"Analysis of Linear Search","pathname":"/data-strutures-and-algorithms/algorithms-analysis/analysis-of-linear-search","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Algorithms Analysis"}]},{"id":"-LGey6Z-MYPZiBP2Re2d","title":"Analysis of Binary Search","pathname":"/data-strutures-and-algorithms/algorithms-analysis/analysis-of-binary-search","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Algorithms Analysis"}]},{"id":"-LGW36TwpZJuL8cICUYZ","title":"How to do an analysis in 5 steps","pathname":"/data-strutures-and-algorithms/algorithms-analysis/how-to-do-an-analysis-in-5-steps","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Algorithms Analysis"}]},{"id":"-LGeyPWFa8y-cDMeoCId","title":"Recursion","pathname":"/data-strutures-and-algorithms/recursion","siteSpaceId":"sitesp_i5xuc","description":""},{"id":"-LGf-22ILGbTn0sf7V3r","title":"Writing a recursive function","pathname":"/data-strutures-and-algorithms/recursion/how-to-write-a-recursive-function","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Recursion"}]},{"id":"-LGsFx08M1duj83N2SF1","title":"How do recursive functions work?","pathname":"/data-strutures-and-algorithms/recursion/how-do-recursive-functions-work","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Recursion"}]},{"id":"-LGs5X8Nhc5lflHED5eT","title":"Analysis of a Recursive Function","pathname":"/data-strutures-and-algorithms/recursion/analysis-of-a-recursive-function","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Recursion"}]},{"id":"-LGf-1GglEz2HZocUwnR","title":"Drawbacks of Recursion and Caution","pathname":"/data-strutures-and-algorithms/recursion/drawbacks-of-recursion-and-caution","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Recursion"}]},{"id":"-LH4Clqp4qNZtXyQ6_Iz","title":"Lists","pathname":"/data-strutures-and-algorithms/lists","siteSpaceId":"sitesp_i5xuc","description":""},{"id":"-LH4F4wGnishaTkepyRh","title":"Implementation","pathname":"/data-strutures-and-algorithms/lists/implementation","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Lists"}]},{"id":"-LH8XsqHr9pfSBRB9zG2","title":"Linked List","pathname":"/data-strutures-and-algorithms/lists/linked-list","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Lists"}]},{"id":"-LI9l4xpq7hUqmVu4gPh","title":"Concepts","pathname":"/data-strutures-and-algorithms/lists/linked-list/implementation","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Lists"},{"label":"Linked List"}]},{"id":"-LKxe4irXxstwBDcVkwd","title":"Implementation - List and Nodes","pathname":"/data-strutures-and-algorithms/lists/linked-list/implementation-list-and-nodes","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Lists"},{"label":"Linked List"}]},{"id":"-LIA0zX4Rcdp2YtE8e5r","title":"Implementation - push_front(), pop_front()","pathname":"/data-strutures-and-algorithms/lists/linked-list/c++-implementation","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Lists"},{"label":"Linked List"}]},{"id":"-LLGtweZYZQarY0cfHCw","title":"Implementation - Iterators","pathname":"/data-strutures-and-algorithms/lists/linked-list/implementation-iterators","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Lists"},{"label":"Linked List"}]},{"id":"-LLGuMEGziOZd7afLrI6","title":"Modification - Sentinel Nodes","pathname":"/data-strutures-and-algorithms/lists/linked-list/modification-sentinel-nodes","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Lists"},{"label":"Linked List"}]},{"id":"-LIA20gGAQYrvlcRaCT9","title":"Stacks and Queues","pathname":"/data-strutures-and-algorithms/stacks-and-queues","siteSpaceId":"sitesp_i5xuc","description":""},{"id":"-LIA3CKVJUam_oZTjZk0","title":"Stack Implementation","pathname":"/data-strutures-and-algorithms/stacks-and-queues/stack-implementation","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Stacks and Queues"}]},{"id":"-LIA3JxYazaH-6rwU4he","title":"Queue Implementation","pathname":"/data-strutures-and-algorithms/stacks-and-queues/queue-implementation","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Stacks and Queues"}]},{"id":"-LIA3YtMIsACdmDVsb6R","title":"Table","pathname":"/data-strutures-and-algorithms/table","siteSpaceId":"sitesp_i5xuc","description":""},{"id":"-LNMfgYD8P988Y7-LIoO","title":"A Simple Implementation","pathname":"/data-strutures-and-algorithms/table/a-simple-implementation","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Table"}]},{"id":"-LNMkkZragmViL2MdjtB","title":"Hash Tables","pathname":"/data-strutures-and-algorithms/table/hash-tables","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Table"}]},{"id":"-LNMm4cV9JpCTU1ztJUN","title":"Bucketing","pathname":"/data-strutures-and-algorithms/table/hash-tables/bucketing","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Table"},{"label":"Hash Tables"}]},{"id":"-LNMm7J_5mdR_8UltCUn","title":"Chaining","pathname":"/data-strutures-and-algorithms/table/hash-tables/chaining","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Table"},{"label":"Hash Tables"}]},{"id":"-LNMmAHPJ69-oEjSGCCD","title":"Linear Probing","pathname":"/data-strutures-and-algorithms/table/hash-tables/untitled-1-2","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Table"},{"label":"Hash Tables"}]},{"id":"-LIA3fXv5WnHaSSDFXzz","title":"Sorting","pathname":"/data-strutures-and-algorithms/sorting","siteSpaceId":"sitesp_i5xuc","description":""},{"id":"-LKz7kxFOklHvUupA5sS","title":"Simple Sorts","pathname":"/data-strutures-and-algorithms/sorting/simple-sorts","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Sorting"}]},{"id":"-LICIkb4OXkbpqMHwz92","title":"Bubble Sort","pathname":"/data-strutures-and-algorithms/sorting/simple-sorts/the-simple-sorts","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Sorting"},{"label":"Simple Sorts"}]},{"id":"-LKz7Gmh56LXEzQcIDsn","title":"Insertion Sort","pathname":"/data-strutures-and-algorithms/sorting/simple-sorts/insertion-sort","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Sorting"},{"label":"Simple Sorts"}]},{"id":"-LKz7pNtjnO03hEznXrP","title":"Selection Sort","pathname":"/data-strutures-and-algorithms/sorting/simple-sorts/selection-sort","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Sorting"},{"label":"Simple Sorts"}]},{"id":"-LNMoVl1k80sE5bWO5uZ","title":"Merge Sort","pathname":"/data-strutures-and-algorithms/sorting/merge-sort","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Sorting"}]},{"id":"-LNMoYVlJhkMc953BYar","title":"Quick Sort","pathname":"/data-strutures-and-algorithms/sorting/quick-sort","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Sorting"}]},{"id":"-LPsfeHriSgVGeNZQ04L","title":"Heap and Heap Sort","pathname":"/data-strutures-and-algorithms/sorting/heap-and-heap-sort","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Sorting"}]},{"id":"-LPsg-N7AaJYjAsnTnj-","title":"Priority Queues using Binary Heaps","pathname":"/data-strutures-and-algorithms/sorting/heap-and-heap-sort/priority-queues-using-binary-heaps","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Sorting"},{"label":"Heap and Heap Sort"}]},{"id":"-LPsn2N0zdztsrK7YIhM","title":"Heapify and Heap Sort","pathname":"/data-strutures-and-algorithms/sorting/heap-and-heap-sort/heap-sort","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Sorting"},{"label":"Heap and Heap Sort"}]},{"id":"-LPsoj-qpMGyjOV3tQb9","title":"Trees","pathname":"/data-strutures-and-algorithms/definitions","siteSpaceId":"sitesp_i5xuc","description":""},{"id":"-LQCy6jPlloVjMX0R-JW","title":"Binary Trees","pathname":"/data-strutures-and-algorithms/definitions/tree-implementation","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Trees"}]},{"id":"-LQCzGT5KcroYXXCX187","title":"Binary Search Trees","pathname":"/data-strutures-and-algorithms/definitions/binary-search-trees","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Trees"}]},{"id":"-LTEfbxfQbv_VzBlW2-x","title":"BST Implemenation","pathname":"/data-strutures-and-algorithms/definitions/linked-list-implementation","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Trees"}]},{"id":"-LTAZ4zUUuZ_oJaC4Qdy","title":"Iterative Methods","pathname":"/data-strutures-and-algorithms/definitions/implementation-of-bst","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Trees"}]},{"id":"-LTEfvrCwtFKeuNZr7NB","title":"Recursive Methods","pathname":"/data-strutures-and-algorithms/definitions/recursive-methods","siteSpaceId":"sitesp_i5xuc","description":"","breadcrumbs":[{"label":"Trees"}]},{"id":"-LQD00iDWZkKnB7Z8Idv","title":"AVL Trees","pathname":"/data-strutures-and-algorithms/avl-trees","siteSpaceId":"sitesp_i5xuc","description":""},{"id":"-LQD1u7x_JGWIs90rK6Z","title":"Red Black Trees","pathname":"/data-strutures-and-algorithms/red-black-trees","siteSpaceId":"sitesp_i5xuc","description":""},{"id":"-LQD2SmqTL5xu-jmZqN_","title":"2-3 Trees","pathname":"/data-strutures-and-algorithms/2-3-trees","siteSpaceId":"sitesp_i5xuc","description":""},{"id":"-LS3Sb4s4FckNCBiAuu1","title":"Graphs","pathname":"/data-strutures-and-algorithms/graphs","siteSpaceId":"sitesp_i5xuc","description":""},{"id":"-LJKwInKS9t0ZpSH7-iN","title":"Introduction to Computational Theory","pathname":"/data-strutures-and-algorithms/theory-of-computation","siteSpaceId":"sitesp_i5xuc","description":""},{"id":"-LGY2AhH9T8_6YqjE41U","title":"Appendix: Markdown","pathname":"/data-strutures-and-algorithms/appendix-markdown","siteSpaceId":"sitesp_i5xuc","description":""},{"id":"-LGTN5C3V64_o2phwluO","title":"Appendix: Mathematics Review","pathname":"/data-strutures-and-algorithms/untitled","siteSpaceId":"sitesp_i5xuc","description":""}]}