suvasish114

import java.util.List;
import java.util.ArrayList;
import javax.swing.JFrame;
import java.awt.Graphics;
import java.awt.Color;
import java.util.Arrays;

// driving code
class BrecenhansLineDrawingAlgorithm{
	public static void main(String[] args) {

suvasish114

#include<jni.h>
#include<stdio.h>
#include "NativeDemo.h"

JNIEXPORT void JNICALL Java_NativeDemo_test(JNIEnv *env, jobject obj){

	jclass cls;
	jfieldID fid;
	jint i;
	

suvasish114

/* DO NOT EDIT THIS FILE - it is machine generated */
#include <jni.h>
/* Header for class NativeDemo */

#ifndef _Included_NativeDemo
#define _Included_NativeDemo
#ifdef __cplusplus
extern "C" {
#endif
/*

suvasish114

class NativeDemo{
	public static void main(String[] args){
		NativeDemo ob = new NativeDemo();
		ob.test();	// call to native method
	}
	public native void test();	// native method without body
		
	static{
		System.loadLibrary("NativeDemo");
	}

suvasish114

#include<iostream>
#include<string>
#include<stdlib.h>
using namespace std;

struct Header{
    string attribute_name;
    struct Header* link;
};

suvasish114

delete duplicate node from a single linked list

language : C

// delete duplicate nodes from a linked list

#include<stdio.h>
#include<cstdlib>

// functions

suvasish114

#include<iostream>
#define SIZE 10
using namespace std;
char tree[SIZE];
void root(char key);
void set_left(char key, int parent);
void set_right(char key, int parent);
void display(void);
int main(){
    root('A');

suvasish114

queue using python

code:

# node defination
class _node :
    def __init__(self, data):
        self.data = data
        self.next = None

suvasish114

#include<iostream>
#define _size 5
using namespace std;
class _queue{
	int front = -1;
	int rear = -1;
	int A[_size];
	public:
		void enqueue(int);
		int dequeue();

suvasish114

// Linkedlist implementation using Classes in C++
#include <iostream>
using namespace std;
class Node {
public:
    int data;
    Node* next;
};

class LinkedList{