update

Author: sinanazem

data-structure/Untitled.ipynb

@@ -0,0 +1,78 @@
+{
+ "cells": [
+ {
+ "cell_type": "markdown",
+ "id": "6e216cd8-2fa4-49c1-b0d1-6a41c2232774",
+ "metadata": {},
+ "source": [
+ "# Data Structure with Python"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "id": "ecb3b4c9-1b88-4031-88e5-7cb10bed4d5f",
+ "metadata": {},
+ "source": [
+ "<img src=\"https://user-images.githubusercontent.com/36534847/110256307-e6347c80-7f76-11eb-9635-df55b02d540a.png\" width=300>"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "id": "4beb59e8-ce07-4eb5-87c1-fe7bf60b4d96",
+ "metadata": {},
+ "source": [
+ "## What is Data Structure?"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "id": "4dba6b7b-7f07-4c79-ac30-9c5fab3741b6",
+ "metadata": {},
+ "source": [
+ "A data structure is a way of organizing and storing data in a computer so that it can be efficiently accessed and manipulated. It provides a means to represent and organize data in a way that allows for efficient operations such as insertion, deletion, retrieval, and search."
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "id": "59220828-e426-4242-bcaf-13da2bcbdfac",
+ "metadata": {},
+ "source": [
+ "We need data structures for several reasons:\n",
+ "- Efficient data access and manipulation: Data structures provide efficient algorithms and techniques for storing and retrieving data. They allow us to perform operations on data in an optimized manner, which is crucial for achieving good performance in computer programs.\n",
+ "- Memory management: Data structures help in managing memory effectively. They provide ways to allocate and deallocate memory dynamically, allowing efficient usage of available memory resources.\n",
+ "- Organization and management of data: Data structures help in organizing and managing large amounts of data. They provide methods for grouping related data together and representing complex relationships between different data elements.\n",
+ "- Optimization of algorithms: The choice of an appropriate data structure can significantly impact the efficiency of algorithms. By selecting the right data structure for a particular problem, we can optimize the time and space complexity of algorithms, resulting in faster and more scalable solutions.\n",
+ "- Problem-solving: Data structures provide a framework for solving various computational problems. They offer different data organization schemes, such as arrays, linked lists, trees, graphs, and hash tables, each suited for specific types of problems. By understanding and utilizing these data structures, we can develop efficient algorithms to solve complex problems."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "id": "bfdcef82-7cf0-4a34-9de0-f5b7c95d502a",
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ }
+ ],
+ "metadata": {
+ "kernelspec": {
+ "display_name": "Python 3 (ipykernel)",
+ "language": "python",
+ "name": "python3"
+ },
+ "language_info": {
+ "codemirror_mode": {
+ "name": "ipython",
+ "version": 3
+ },
+ "file_extension": ".py",
+ "mimetype": "text/x-python",
+ "name": "python",
+ "nbconvert_exporter": "python",
+ "pygments_lexer": "ipython3",
+ "version": "3.10.14"
+ }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 5
+}

data-structure/linked-list/linked-list-2.ipynb

@@ -77,8 +77,8 @@
  " \n",
  " else:\n",
  " temp = self.head\n",
- " \n",
- " while index - 1 :\n",
+ " index =- 1\n",
+ " while index :\n",
  " temp = temp.next\n",
  " index = index-1\n",
  " data = temp.next.data\n",

data-structure/linked-list/linked-list.ipynb

@@ -126,12 +126,11 @@
  " new_node.next = temp\n",
  " pre.next = new_node\n",
  " self.length += 1\n",
- " \n",
- "\n",
- " \n",
- " \n",
+ " def pop(self, index, ):\n",
  " \n",
  " \n",
+ " return\n",
+ " \n",
  " \n",
  " def __len__(self):\n",
  " return self.length\n",