Ajay-Raj-S

package datastructures;

import java.util.ArrayList;

public class checkLoop {
    Node head = null;
    Node last = null;
    int size = 0;
    
    static class Node {

Ajay-Raj-S

package datastructures;

public class StackUsingLL {
    
    private Node top = null;
    private Node head = null;
    private int size = 0;
        
    class Node {
        int data;

Ajay-Raj-S

#include<stdio.h>
#include<stdlib.h>

struct node {
	struct node* parent;
	struct node* left;
	int value;
	struct node* right;
};

Ajay-Raj-S

#include<stdio.h>
#include<stdlib.h>
#define MAX 5

int front = 0;
int last = 0;
int queue[MAX];

void enqueue(int val) {		 
	queue[last++] = val;

Ajay-Raj-S

#include<stdio.h>
#include<stdlib.h>
#define MAX 10

int top = -1;
int stack[MAX];

void push(int val) {
	stack[++top] = val;
	printf("Value Pushed!\n");

Ajay-Raj-S

#include<stdio.h>
#include<stdlib.h>


// circular linked list using Singly Linked list
struct circular {
	int value;
	struct circular* next;
};

Ajay-Raj-S

#include<stdio.h>
#include<stdlib.h>

struct doubly {
	struct doubly* prev;
	int value;
	struct doubly* next;
};

typedef struct doubly* node;

Ajay-Raj-S

#include<stdio.h>
#include<stdlib.h>

struct list {
	int value;
	struct list* next;
};

struct list* root = NULL;
struct list* lastNodeAddr = NULL;