From 786bf69c84d06a70caaf897927f760f13b50cd0f Mon Sep 17 00:00:00 2001 From: Muhammad Usman Date: Sun, 20 Oct 2019 12:29:31 +0500 Subject: [PATCH 1/2] Update list.c --- list.c | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/list.c b/list.c index ab58bd5..6b7d17d 100644 --- a/list.c +++ b/list.c @@ -15,6 +15,7 @@ struct Node Position Next; }; +/* Deleting Junk Data from List */ List MakeEmpty(List L) { if (L != NULL) DeleteList(L); @@ -48,6 +49,8 @@ int IsLast(Position P, List L) /* START: fig3_10.txt */ /* Return Position of X in L; NULL if not found */ + +/* Function to find aan element from the list */ Position Find(ElementType X, List L) { @@ -178,4 +181,4 @@ Retrieve(Position P) { return P->Element; } -// File End ... \ No newline at end of file +// File End ... From b5a8b71be9dedc4083340c0e7cb668993a0681c6 Mon Sep 17 00:00:00 2001 From: Muhammad Aqdas <56063389+aqdasmuhammad@users.noreply.github.com> Date: Sat, 10 Oct 2020 16:03:47 +0500 Subject: [PATCH 2/2] Create README.md --- README.md | 3 +++ 1 file changed, 3 insertions(+) create mode 100644 README.md diff --git a/README.md b/README.md new file mode 100644 index 0000000..bef6560 --- /dev/null +++ b/README.md @@ -0,0 +1,3 @@ +# DataStructure-Algorithm +This repository contains the basic header and source files for List, Stack , Queues and Tree. +Pre-defined functions are there in order to to implement any function of List, Stack and Queues.