Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update list.c #1

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
+7 −1
Open

Update list.c #1

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
786bf69
Update list.c
usmanmumtaz Oct 20, 2019
b5a8b71
Create README.md
aqdasmuhammad Oct 10, 2020
6e83d44
Merge pull request #1 from aqdasmuhammad/master
usmanmumtaz Oct 10, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 3 additions & 0 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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.
5 changes: 4 additions & 1 deletion list.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -15,6 +15,7 @@ struct Node
Position Next;
};

/* Deleting Junk Data from List */
List MakeEmpty(List L) {
if (L != NULL)
DeleteList(L);
Expand Down Expand Up @@ -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)
{
Expand Down Expand Up @@ -178,4 +181,4 @@ Retrieve(Position P)
{
return P->Element;
}
// File End ...
// File End ...