Israr ahmed israr-ahmad

## Doubly_circular_Linklist.cpp

#include <iostream>
#include <windows.h>
using namespace std;

struct Node
{
    int data;
    Node* next;
    Node* back;

## Doubly_Linklist.cpp

#include <iostream>
#include <windows.h>
using namespace std;
//--------->>>AAHHOOO!!!!!!!!!!...................<<<------------------------------
struct Node
{
    int data;
    Node* next;
    Node* back;

## Singly_Linklist.cpp

#include <iostream>
#include <windows.h>
using namespace std;

struct Node
{
    int data;
    Node* next;
};

## Stack_array_base.pp

#include <iostream>

using namespace std;

bool isEmpty(int top);
bool isFull(int top,int maxSize);
void push(int &top,int stack[],int item,int maxSize);
void pop(int &top,int stack[]);
void print(int top,int stack[]);

## Stack_Linklist_Base.cpp

#include <iostream>
#include <windows.h>
using namespace std;
//--------->>>AAHHOOO!!!!!!!!!!...................<<<------------------------------
struct Node
{
    int data;
    Node* next;
};

	#include <iostream>
	#include <windows.h>
	using namespace std;

	struct Node
	{
	int data;
	Node* next;
	Node* back;

	#include <iostream>

	using namespace std;

	bool isEmpty(int top);
	bool isFull(int top,int maxSize);
	void push(int &top,int stack[],int item,int maxSize);
	void pop(int &top,int stack[]);
	void print(int top,int stack[]);