From 8ddd791486f0a7e06e65847ebfcb4f17a0976212 Mon Sep 17 00:00:00 2001 From: Mehr-un-nisa <55224607+Mehr-un-nisa@users.noreply.github.com> Date: Mon, 3 Oct 2022 18:21:17 +0500 Subject: [PATCH 1/5] Update README.md --- README.md | 30 ++++++++++++++++++++++-------- 1 file changed, 22 insertions(+), 8 deletions(-) diff --git a/README.md b/README.md index 2a6096f..7078352 100644 --- a/README.md +++ b/README.md @@ -1,8 +1,22 @@ -# Data_Structures: Data Structures are a specialized means of organizing and storing data in computers in such a way that we can perform operations on the stored data more efficiently. Data structures have a wide and diverse scope of usage across the fields of Computer Science and Software Engineering. -Programs related to data structures in C++ from my university course. - Following Data Structures are implemented: -* Binary Tree -* Circular Linked List -* Prioriy Queue -* Queue -* Stack +# Data_Structures +

Data Structures are a specialized means of organizing and storing data in computers in such a way that we can perform operations on the stored data more efficiently. Data structures have a wide and diverse scope of usage across the fields of Computer Science and Software Engineering.

+

Programs related to data structures in C++ from my university course. + Following Data Structures are implemented:

+
  • Binary Tree
    • +
  • Circular Linked List
    • +
  • Double link list
    • +
  • Prioriy Queue
    • +
  • Queue
    • +
  • Stack
    • +
  • Hash tree
    • +
    +![dta](https://user-images.githubusercontent.com/55224607/193586623-992ba32a-52a0-4f42-97b6-ad3fd2522978.png) +
    + +

    Data structures are an integral part of computers used for the arrangement of data in memory. They are essential and responsible for organizing, processing, accessing, and storing data efficiently. But this is not all. Various types of data structures have their own characteristics, features, applications, advantages, and disadvantages

    +

    Benefits of data structure

    +
  • Data structure modification is easy.
    • +
  • It requires less time.
    • +
  • Save storage memory space
    • +
  • Data representation is easy
    • +
  • Easy access to the large database
    • From 4b7d3bb8ba5e217de3344e3c86bc693d2544c3c4 Mon Sep 17 00:00:00 2001 From: Mehr-un-nisa <55224607+Mehr-un-nisa@users.noreply.github.com> Date: Mon, 3 Oct 2022 18:21:39 +0500 Subject: [PATCH 2/5] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 7078352..c63ae6d 100644 --- a/README.md +++ b/README.md @@ -10,7 +10,7 @@
  • Stack
  • Hash tree

    • -![dta](https://user-images.githubusercontent.com/55224607/193586623-992ba32a-52a0-4f42-97b6-ad3fd2522978.png) +[dta](https://user-images.githubusercontent.com/55224607/193586623-992ba32a-52a0-4f42-97b6-ad3fd2522978.png)

    Data structures are an integral part of computers used for the arrangement of data in memory. They are essential and responsible for organizing, processing, accessing, and storing data efficiently. But this is not all. Various types of data structures have their own characteristics, features, applications, advantages, and disadvantages

    From c69aa9e307f9ce87b5153b296f0a25d498759b00 Mon Sep 17 00:00:00 2001 From: Mehr-un-nisa <55224607+Mehr-un-nisa@users.noreply.github.com> Date: Mon, 3 Oct 2022 18:22:07 +0500 Subject: [PATCH 3/5] Update README.md --- README.md | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index c63ae6d..636bea7 100644 --- a/README.md +++ b/README.md @@ -10,7 +10,7 @@
  • Stack
  • Hash tree

    • -[dta](https://user-images.githubusercontent.com/55224607/193586623-992ba32a-52a0-4f42-97b6-ad3fd2522978.png) +

    Data structures are an integral part of computers used for the arrangement of data in memory. They are essential and responsible for organizing, processing, accessing, and storing data efficiently. But this is not all. Various types of data structures have their own characteristics, features, applications, advantages, and disadvantages

    @@ -20,3 +20,5 @@
  • Save storage memory space
  • Data representation is easy
  • Easy access to the large database
    • + +![dta](https://user-images.githubusercontent.com/55224607/193588277-3b2832c4-ca7f-47c4-98cc-0c40fe43a168.png) From 4235d2b907d2ffd616992d7dc01fd98f27a0b112 Mon Sep 17 00:00:00 2001 From: Mehr-un-nisa <55224607+Mehr-un-nisa@users.noreply.github.com> Date: Mon, 3 Oct 2022 18:22:19 +0500 Subject: [PATCH 4/5] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 636bea7..dc3c6ae 100644 --- a/README.md +++ b/README.md @@ -20,5 +20,5 @@
  • Save storage memory space
  • Data representation is easy
  • Easy access to the large database
    • - +
    ![dta](https://user-images.githubusercontent.com/55224607/193588277-3b2832c4-ca7f-47c4-98cc-0c40fe43a168.png) From bbccf23c7fb802741c63775f141bf24106983216 Mon Sep 17 00:00:00 2001 From: Mehr-un-nisa <55224607+Mehr-un-nisa@users.noreply.github.com> Date: Mon, 3 Oct 2022 18:22:39 +0500 Subject: [PATCH 5/5] Update README.md --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index dc3c6ae..a1fd884 100644 --- a/README.md +++ b/README.md @@ -19,6 +19,6 @@
  • It requires less time.
  • Save storage memory space
  • Data representation is easy
    • -
  • Easy access to the large database
    • -
    +
  • Easy access to the large database

    • + ![dta](https://user-images.githubusercontent.com/55224607/193588277-3b2832c4-ca7f-47c4-98cc-0c40fe43a168.png)