{
    "componentChunkName": "component---src-templates-learn-js",
    "path": "/learn/ds/linear_data_structures",
    "result": {"data":{"mdx":{"frontmatter":{"title":"Linear Data Structures","date":"July 24, 2021","tags":["ds"],"description":"Linear Data Structuress"},"body":"var _excluded = [\"components\"];\n\nfunction _extends() { _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\n\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\n\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\n\n/* @jsxRuntime classic */\n\n/* @jsx mdx */\nvar _frontmatter = {\n  \"title\": \"Linear Data Structures\",\n  \"date\": \"2021-07-24\",\n  \"description\": \"Linear Data Structuress\",\n  \"tags\": [\"ds\"],\n  \"type\": \"tuts\"\n};\n\nvar makeShortcode = function makeShortcode(name) {\n  return function MDXDefaultShortcode(props) {\n    console.warn(\"Component \" + name + \" was not imported, exported, or provided by MDXProvider as global scope\");\n    return mdx(\"div\", props);\n  };\n};\n\nvar Callouts = makeShortcode(\"Callouts\");\nvar layoutProps = {\n  _frontmatter: _frontmatter\n};\nvar MDXLayout = \"wrapper\";\nreturn function MDXContent(_ref) {\n  var components = _ref.components,\n      props = _objectWithoutProperties(_ref, _excluded);\n\n  return mdx(MDXLayout, _extends({}, layoutProps, props, {\n    components: components,\n    mdxType: \"MDXLayout\"\n  }), mdx(\"p\", null, \"A Data Structure is said to be linear if its elements form a sequence or a linear list.\\nThere are two ways of representing linear data structures in memory. One way is to have the linear relationship between the elements\\nby means of sequential memory locations. Such linear structures are \", mdx(\"strong\", null, \"Arrays\"), \". The other way is to have the linear relationship\\nbetween the elements representing by means of links. such linear data structures are called \", mdx(\"strong\", null, \"Linked List\"), \".\"), mdx(\"h4\", null, \"Examples:\"), mdx(\"ul\", null, mdx(\"li\", {\n    parentName: \"ul\"\n  }, \"Arrays\"), mdx(\"li\", {\n    parentName: \"ul\"\n  }, \"Linked Lists\"), mdx(\"li\", {\n    parentName: \"ul\"\n  }, \"Stacks\"), mdx(\"li\", {\n    parentName: \"ul\"\n  }, \"Queues\")), mdx(Callouts, {\n    name: \"info \",\n    mdxType: \"Callouts\"\n  }, \"Stacks and Queues are implemented using Arrays and Lists\"), mdx(\"h4\", null, \"Arrays Representation\"), mdx(\"div\", {\n    className: \"arrays\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, \"Value1 \"), mdx(\"li\", null, \"Value2\"))), \"Arrays are Homogenous and Static type (allocations of memory is done at the beginning)\", mdx(\"h4\", null, \"Linked List representation\"), mdx(\"div\", {\n    className: \"linked__container\"\n  }, mdx(\"ul\", null, mdx(\"li\", null, \"Value | NextNode\"), mdx(\"li\", null, \"Value | NextNode\"))), \"NextNode will store address of a next connected node. Linked Lists are HetroGenous and Dynamic type (allocation of memory is done at run time)\", mdx(Callouts, {\n    name: \"success \",\n    mdxType: \"Callouts\"\n  }, \"Homogenous (Arrays) : The data structures which contains single type of data either Integer or Strings or Other\", mdx(\"br\", null), \"HetroGenous (Lists) : The Data Structure which contains multiple types of data like Interger ,Strings, Floats\"));\n}\n;\nMDXContent.isMDXComponent = true;","slug":"ds/linear_data_structures"},"allMdx":{"edges":[{"node":{"slug":"ds/arrays","id":"8ab43cbe-bc50-5590-925e-1a45d7028386"}},{"node":{"slug":"ds/binary_addition","id":"26e70246-f787-5a17-baa8-9375bbacc879"}},{"node":{"slug":"ds/binary_divison","id":"ec6f892f-531e-5661-8a44-d08f906ecba5"}},{"node":{"slug":"ds/binary_operations","id":"b2e4a072-3108-546d-a06a-646e43d834cc"}},{"node":{"slug":"ds/binary_multiplication","id":"0b241fae-5107-5843-b21e-7a5ed393168f"}},{"node":{"slug":"ds/binary_substraction","id":"18f53266-039e-5e0c-af57-37c05a2e80ec"}},{"node":{"slug":"ds/linear_data_structures","id":"0d96c16b-7430-59aa-b81a-73e67dcfd3d2"}},{"node":{"slug":"ds/bit_manipulation","id":"03ba2551-8800-5f50-9724-3a84d09a5989"}},{"node":{"slug":"ds/intro","id":"67e2c78b-07c3-57cf-9984-08e405f77783"}},{"node":{"slug":"ds/roadmap","id":"f7856a33-93ca-5464-8e5a-d5dc41765650"}},{"node":{"slug":"ds/programming_language","id":"ac14fda6-ff3a-5306-964a-3ce25168a6f0"}},{"node":{"slug":"ds/number_systems","id":"12494952-aaee-5db2-91ef-4db461c5b95c"}},{"node":{"slug":"ds/time_space_complex","id":"b7695373-5e9c-56c5-9b7f-5a632785916f"}}]}},"pageContext":{"id":"0d96c16b-7430-59aa-b81a-73e67dcfd3d2","filePath":"/ds/","previousPostId":"ds/arrays","nextPostId":"ds/bit_manipulation"}},
    "staticQueryHashes": ["2033233798"]}