Category Archives: Data Structure

ArrayList in Java

Posted on July 7, 2020 | Leave a comment

ArrayList in Java:

package com.zakilive;

import java.util.ArrayList;

public class Main {

    public static void main(String[] args) {
	// working with arraylist

        ArrayList words=new ArrayList<>();
        words.add("hello"); //string
        words.add("there");
        words.add(9); //integer
        words.add(12.00); //double
        words.add('H'); //character

        int item1= (int) words.get(2);
        double item2= (double) words.get(3);
        String item3= (String) words.get(0);

        System.out.println(item1+item2);


    }
}

package com.zakilive;

import java.util.ArrayList;

public class Main {

public static void main(String[] args) {

// working with arraylist

ArrayList words=new ArrayList<>();

words.add("hello"); //string

words.add("there");

words.add(9); //integer

words.add(12.00); //double

words.add('H'); //character

int item1= (int) words.get(2);

double item2= (double) words.get(3);

String item3= (String) words.get(0);

System.out.println(item1+item2);

}

Generics:

package com.zakilive;

import java.util.ArrayList;
import java.util.LinkedList;

public class Main {

    public static void main(String[] args) {
	// working with arraylist

        ArrayList<String> words=new ArrayList<String>();
        words.add("hello"); //string
        words.add("there");
        words.add("9"); //integer
//        words.add(12.00); //double
//        words.add('H'); //character

//        int item1= (int) words.get(2);
//        double item2= (double) words.get(3);
        String item3= (String) words.get(2);
        System.out.println(item3);

//        System.out.println(item1+item2);
        LinkedList<Integer> numbers=new LinkedList<Integer>();
        numbers.add(100);
        numbers.add(200);
        numbers.removeFirst();

        for(int number: numbers)
        {
            System.out.println(number);
        }

    }
}

package com.zakilive;

import java.util.ArrayList;

import java.util.LinkedList;

public class Main {

public static void main(String[] args) {

// working with arraylist

ArrayList<String> words=new ArrayList<String>();

words.add("hello"); //string

words.add("there");

words.add("9"); //integer

// words.add(12.00); //double

// words.add('H'); //character

// int item1= (int) words.get(2);

// double item2= (double) words.get(3);

String item3= (String) words.get(2);

System.out.println(item3);

// System.out.println(item1+item2);

LinkedList<Integer> numbers=new LinkedList<Integer>();

numbers.add(100);

numbers.add(200);

numbers.removeFirst();

for(int number: numbers)

{

System.out.println(number);

}

LinkedList is faster for manipulation but slower for retrieval and ArrayList is slower for manipulation but faster for retrieval

Leave a comment

Posted in Data Structure, Java

Algo – Linked List

Posted on June 5, 2017 | Leave a comment

Best Video Explained:

code:

some bugs here but understood the implementation:

#include<bits/stdc++.h>
void display(void);
void addatbegin(void);
void addafter(void);
struct node
{
    int data;
    struct node *link;
};

struct node *root=NULL;
int len;

void append()
{

    struct node *temp;
    temp=(struct node*)malloc(sizeof(struct node));
    printf("Enter node data: ");
    scanf("%d", &temp->data);
    temp->link=NULL;
    if(root==NULL) //list is empty
    {
        root=temp;
    }
    else
    {
        struct node* p;
        p=root;
        while(p->link!=NULL)
        {
            p=p->link;
        }
        p->link=temp;
    }
}

int length()
{
    int cnt=0;
    struct node *temp;
    temp=root;
    while(temp!=NULL)
    {
        cnt++;
        temp=temp->link;
    }
    return cnt;
}
void display()
{
    struct node* temp;
    temp==root;
    if(temp==NULL)
    {
        printf("List is empty\n");

    }
    else
    {
        while(temp!=NULL)
        {
            printf("%d-->",temp->data);
            temp=temp->link;
        }
        printf("\n");
    }
}
//void delete();

int main()
{
    int ch;
    while(1)
    {
        printf("Single linked list op:");
        printf("1. Append\n");
        printf("2. Add at begin\n");
        printf("3. Add at after\n");
        printf("4. Lenght\n");
        printf("5. Display\n");
        printf("6. Delete\n");
        printf("7. Quit\n");
        printf("enter your chocie: ");
        scanf("%d",ch);
        switch(ch)
        {
        case 1:
            append();
            break;
        case 2:
            addatbegin();
            break;
        case 3:
            addafter();
            break;
        case 4:
            len=length();
            printf("Length=%d",len);
            break;
        case 5:
            display();
            break;
        case 7:
            exit(1);
        default:
            printf("invalid\n");

        }
    }
}

100

101

102

103

104

105

106

107

108

109

110

111

#include<bits/stdc++.h>

void display(void);

void addatbegin(void);

void addafter(void);

struct node

{

int data;

struct node *link;

};

struct node *root=NULL;

int len;

void append()

{

struct node *temp;

temp=(struct node*)malloc(sizeof(struct node));

printf("Enter node data: ");

scanf("%d", &temp->data);

temp->link=NULL;

if(root==NULL) //list is empty

{

root=temp;

}

else

{

struct node* p;

p=root;

while(p->link!=NULL)

{

p=p->link;

}

p->link=temp;

}

int length()

{

int cnt=0;

struct node *temp;

temp=root;

while(temp!=NULL)

{

cnt++;

temp=temp->link;

}

return cnt;

}

void display()

{

struct node* temp;

temp==root;

if(temp==NULL)

{

printf("List is empty\n");

}

else

{

while(temp!=NULL)

{

printf("%d-->",temp->data);

temp=temp->link;

}

printf("\n");

}

//void delete();

int main()

{

int ch;

while(1)

{

printf("Single linked list op:");

printf("1. Append\n");

printf("2. Add at begin\n");

printf("3. Add at after\n");

printf("4. Lenght\n");

printf("5. Display\n");

printf("6. Delete\n");

printf("7. Quit\n");

printf("enter your chocie: ");

scanf("%d",ch);

switch(ch)

{

case 1:

append();

break;

case 2:

addatbegin();

break;

case 3:

addafter();

break;

case 4:

len=length();

printf("Length=%d",len);

break;

case 5:

display();

break;

case 7:

exit(1);

default:

printf("invalid\n");

}

Leave a comment

Posted in A ll Codes, Algorithm, C, Linked List

Algo DS: Circular Queue

Posted on May 31, 2017 | Leave a comment

code:

#include<stdio.h>
#define size 4
int q[size];
int rear=-1;
int front=-1;

Enqueue(int item){
    if((rear+1)%size==front){
        printf("Queue Overflow\n");
    }else{
        if(rear==-1 && front==-1)
        {
            rear=0;
            front=0;
        }
        else{
            rear=(rear+1)%size;
        }
        q[rear]=item;
        printf("%d is inserted\n",item);
    }
}

 Dequeue(){
    int value;
    if(rear==-1 && front==-1)
    {
        printf("Queue underflow\n");
        return -1;
    }
    else{
        value=q[front];
        if(rear==front)
        {
            rear=-1;
            front=-1;
        }
        else{
            front=(front+1)%size;
        }
        return value;
    }
}

void Display()
{
    int i;
    if(rear==-1 && front==-1)
    {
        printf("Queue is empty\n");
    }
    else{
        if(front<=rear)
        {
            for(i=front;i<=rear;i++)
            {
                printf("q[%d]=%d\n",i,q[i]);
            }
        }
        else{
            for(i=front;i<size-1;i++)
            {
                printf("q[%d]=%d\n",i,q[i]);
                for(i=0;i<=rear;i++)
                {
                    printf("q[%d]=%d\n",i,q[i]);
                }
            }
        }
    }


}

int main()
{
    int cho,n;
    do{
        printf("press 1 for queue\n");
        printf("press 2 for dequeue\n");
        printf("press 3 for display\n");
        printf("press 4 for exit\n");
        printf("Enter your choice: ");
        scanf("%d",&cho);
        switch(cho)
        {
        case 1:

            printf("Enter item to insert: ");
            scanf("%d",&n);
            Enqueue(n);
            break;
        case 2:
            Dequeue();
            break;
        case 3:
            Display();
            break;
        }

    }while(cho!=4);


    return 0;
}

100

101

102

103

104

105

#include<stdio.h>

#define size 4

int q[size];

int rear=-1;

int front=-1;

Enqueue(int item){

if((rear+1)%size==front){

printf("Queue Overflow\n");

}else{

if(rear==-1 && front==-1)

{

rear=0;

front=0;

}

else{

rear=(rear+1)%size;

}

q[rear]=item;

printf("%d is inserted\n",item);

}

Dequeue(){

int value;

if(rear==-1 && front==-1)

{

printf("Queue underflow\n");

return -1;

}

else{

value=q[front];

if(rear==front)

{

rear=-1;

front=-1;

}

else{

front=(front+1)%size;

}

return value;

}

void Display()

{

int i;

if(rear==-1 && front==-1)

{

printf("Queue is empty\n");

}

else{

if(front<=rear)

{

for(i=front;i<=rear;i++)

{

printf("q[%d]=%d\n",i,q[i]);

}

else{

for(i=front;i<size-1;i++)

{

printf("q[%d]=%d\n",i,q[i]);

for(i=0;i<=rear;i++)

{

printf("q[%d]=%d\n",i,q[i]);

}

int main()

{

int cho,n;

do{

printf("press 1 for queue\n");

printf("press 2 for dequeue\n");

printf("press 3 for display\n");

printf("press 4 for exit\n");

printf("Enter your choice: ");

scanf("%d",&cho);

switch(cho)

{

case 1:

printf("Enter item to insert: ");

scanf("%d",&n);

Enqueue(n);

break;

case 2:

Dequeue();

break;

case 3:

Display();

break;

}

}while(cho!=4);

return 0;

}

Leave a comment

Posted in A ll Codes, Algorithm, C, C Refresh, Circular Queue

Data Structure: Queue

Posted on May 26, 2017 | Leave a comment

Stack VS Queue difference:
https://www.youtube.com/watch?v=XuCbpw6Bj1U

code:

/*
 * C Program to Implement a Queue using an Array
 */

#include <stdio.h>
#include <conio.h>
#define N 10

int queue[N];
int rear = - 1;
int front = - 1;
main()
{
    int choice;
    while (1)
    {
        printf("1.Insert element to queue \n");
        printf("2.Delete element from queue \n");
        printf("3.Display all elements of queue \n");
        printf("4.Quit \n");
        printf("Enter your choice : ");
        scanf("%d", &choice);
        switch (choice)
        {
            case 1:insert();
            	   break;

            case 2:delete();
                   break;

            case 3:display();
                   break;

            case 4:exit(1);
            
            default:printf("Wrong choice \n");
            
        } /*End of switch*/
    } /*End of while*/
} /*End of main()*/


insert()
{
    int element;

    if (rear == N - 1)
    printf("Queue Overflow \n");

    else
    {
        if (front == - 1)
        /*If queue is initially empty */
        front = 0;
        
        printf("Inset the element in queue : ");
        scanf("%d", &element);
        rear = rear + 1;
        queue[rear] = element;
    }
} 
 

delete()
{
    if (front == - 1 || front > rear)
    {
        printf("Queue Underflow \n");
        return ;
    }

    else
    {
        printf("Element deleted from queue is : %d\n", queue[front]);
        front = front + 1;
    }
} 


display()
{
    int i;

    if (front == - 1)
        printf("Queue is empty \n");

    else
    {
        printf("Queue is : \n");
        for (i = front; i <= rear; i++)
            printf("%d ", queue[i]);
        printf("\n");
    }
} 


Output:-

1.Insert element to queue
2.Delete element from queue
3.Display all elements of queue
4.Quit

Enter your choice : 1
Inset the element in queue : 10

1.Insert element to queue
2.Delete element from queue
3.Display all elements of queue
4.Quit

Enter your choice : 1
Inset the element in queue : 50

1.Insert element to queue
2.Delete element from queue
3.Display all elements of queue
4.Quit

Enter your choice : 1
Inset the element in queue : 30

1.Insert element to queue
2.Delete element from queue
3.Display all elements of queue
4.Quit

Enter your choice : 1
Inset the element in queue : 60

1.Insert element to queue
2.Delete element from queue
3.Display all elements of queue
4.Quit

Enter your choice : 2
Element deleted from queue is : 10

1.Insert element to queue
2.Delete element from queue
3.Display all elements of queue
4.Quit

Enter your choice : 3
Queue is :
50 30 60

1.Insert element to queue
2.Delete element from queue
3.Display all elements of queue
4.Quit

Enter your choice : 4

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

* C Program to Implement a Queue using an Array

#include <stdio.h>

#include <conio.h>

#define N 10

int queue[N];

int rear = - 1;

int front = - 1;

main()

{

int choice;

while (1)

{

printf("1.Insert element to queue \n");

printf("2.Delete element from queue \n");

printf("3.Display all elements of queue \n");

printf("4.Quit \n");

printf("Enter your choice : ");

scanf("%d", &choice);

switch (choice)

{

case 1:insert();

break;

case 2:delete();

break;

case 3:display();

break;

case 4:exit(1);

default:printf("Wrong choice \n");

} /*End of switch*/

} /*End of while*/

} /*End of main()*/

insert()

{

int element;

if (rear == N - 1)

printf("Queue Overflow \n");

else

{

if (front == - 1)

/*If queue is initially empty */

front = 0;

printf("Inset the element in queue : ");

scanf("%d", &element);

rear = rear + 1;

queue[rear] = element;

}

delete()

{

if (front == - 1 || front > rear)

{

printf("Queue Underflow \n");

return ;

}

else

{

printf("Element deleted from queue is : %d\n", queue[front]);

front = front + 1;

}

display()

{

int i;

if (front == - 1)

printf("Queue is empty \n");

else

{

printf("Queue is : \n");

for (i = front; i <= rear; i++)

printf("%d ", queue[i]);

printf("\n");

}

Output:-

1.Insert element to queue

2.Delete element from queue

3.Display all elements of queue

4.Quit

Enter your choice : 1

Inset the element in queue : 10

1.Insert element to queue

2.Delete element from queue

3.Display all elements of queue

4.Quit

Enter your choice : 1

Inset the element in queue : 50

1.Insert element to queue

2.Delete element from queue

3.Display all elements of queue

4.Quit

Enter your choice : 1

Inset the element in queue : 30

1.Insert element to queue

2.Delete element from queue

3.Display all elements of queue

4.Quit

Enter your choice : 1

Inset the element in queue : 60

1.Insert element to queue

2.Delete element from queue

3.Display all elements of queue

4.Quit

Enter your choice : 2

Element deleted from queue is : 10

1.Insert element to queue

2.Delete element from queue

3.Display all elements of queue

4.Quit

Enter your choice : 3

Queue is :

50 30 60

1.Insert element to queue

2.Delete element from queue

3.Display all elements of queue

4.Quit

Enter your choice : 4

My implementation:

#include<stdio.h>
#include<stdlib.h>
#define MAX 10
int q[MAX];
int front=-1;
int rear=-1;
void Insert()
{
    int element;
    if(rear==MAX-1)
        printf("\nQueue Overflow\n");
    else
    {
        if(front==-1)
            front=0;
        printf("Insert the element in queue: ");
        scanf("%d",&element);
        rear=rear+1;
        q[rear]=element;
    }
}

void Delete()
{
    if(front==-1||front>rear)
    {
        printf("\nQueue Underflow\n");
        return;
    }
    else
    {
        printf("\nElement deleted from queue is: %d\n",q[front]);
        front=front+1;
    }
}
void Display()
{
    int i;
    if(front==-1)
        printf("\nQueue is empty\n");
    else
    {
        printf("\nQueue is: ");
        for(i=front; i<=rear; i++)
            printf("%d ",q[i]);
        printf("\n");
    }

}

int main()
{


    int choice;
    while(1)
    {

        printf("1. Insert element to queue\n");
        printf("2. Delete elements\n");
        printf("3. Display all elements\n");
        printf("4. Quit\n");
        printf("Enter your choice: ");
        scanf("%d",&choice);
        switch(choice)
        {
        case 1:
            Insert();
            break;
        case 2:
            Delete();
            break;
        case 3:
            Display();
            break;
        case 4:
            exit(1);
        default:
            printf("Wrong Choice\n");

        }
    }


    return 0;
}

#include<stdio.h>

#include<stdlib.h>

#define MAX 10

int q[MAX];

int front=-1;

int rear=-1;

void Insert()

{

int element;

if(rear==MAX-1)

printf("\nQueue Overflow\n");

else

{

if(front==-1)

front=0;

printf("Insert the element in queue: ");

scanf("%d",&element);

rear=rear+1;

q[rear]=element;

}

void Delete()

{

if(front==-1||front>rear)

{

printf("\nQueue Underflow\n");

return;

}

else

{

printf("\nElement deleted from queue is: %d\n",q[front]);

front=front+1;

}

void Display()

{

int i;

if(front==-1)

printf("\nQueue is empty\n");

else

{

printf("\nQueue is: ");

for(i=front; i<=rear; i++)

printf("%d ",q[i]);

printf("\n");

}

int main()

{

int choice;

while(1)

{

printf("1. Insert element to queue\n");

printf("2. Delete elements\n");

printf("3. Display all elements\n");

printf("4. Quit\n");

printf("Enter your choice: ");

scanf("%d",&choice);

switch(choice)

{

case 1:

Insert();

break;

case 2:

Delete();

break;

case 3:

Display();

break;

case 4:

exit(1);

default:

printf("Wrong Choice\n");

}

return 0;

}

Another Video:

https://www.youtube.com/watch?v=okr-XE8yTO8

Code from the video Mycodeschool(Using circular queue):

#include<stdio.h>
using namespace std;
#define MAX_SIZE 101
int A[MAX_SIZE];
int fronta,rear;

bool IsEmpty()
{
    return(fronta==-1 && rear==-1);
}

bool IsFull()
{
   // if(rear==MAX_SIZE-1)
    if((rear+1)%MAX_SIZE==fronta)
        return true;
    else
        return false;
}
void Enqeue(int x)
{
    printf("Enqueuing: %d",x);
    if(IsFull()){
        printf("Error: Queue is full\n");
        return;
    }
    else if(IsEmpty())
    {
        fronta=rear=0;
    }
    else
    {
        rear=(rear+1)%MAX_SIZE;
    }
    A[rear]=x;
}

void Dequeue()
{
    printf("Dequeuing:  ");
    if(IsEmpty())
        return;
    else if(fronta==rear)
        fronta=rear=1;
    else
        fronta=(fronta+1)%MAX_SIZE;
}

int Froonta()
{
    if(fronta==-1)
    {
        printf("Can't return from an empty queue\n");
        return -1;
    }
    return A[fronta];
}

void print()
{
    int counta=(rear+MAX_SIZE-fronta)%MAX_SIZE+1;
    printf(" Queue:  ");
    int i;
    for(i=0; i<counta; i++)
    {
        int index=(fronta+i)%MAX_SIZE;
        printf("%d ",A[index]);  //Index of element while traaversing circulrly from front
    }
    printf("\n");
}

int main()
{
    Enqeue(2);
    print();
    Enqeue(4);
    print();
    Enqeue(6);
    print();
    Enqeue(8);
    print();
    Dequeue();
    print();
    Enqeue(8);
    print();
    return 0;
}

#include<stdio.h>

using namespace std;

#define MAX_SIZE 101

int A[MAX_SIZE];

int fronta,rear;

bool IsEmpty()

{

return(fronta==-1 && rear==-1);

}

bool IsFull()

{

// if(rear==MAX_SIZE-1)

if((rear+1)%MAX_SIZE==fronta)

return true;

else

return false;

}

void Enqeue(int x)

{

printf("Enqueuing: %d",x);

if(IsFull()){

printf("Error: Queue is full\n");

return;

}

else if(IsEmpty())

{

fronta=rear=0;

}

else

{

rear=(rear+1)%MAX_SIZE;

}

A[rear]=x;

}

void Dequeue()

{

printf("Dequeuing: ");

if(IsEmpty())

return;

else if(fronta==rear)

fronta=rear=1;

else

fronta=(fronta+1)%MAX_SIZE;

}

int Froonta()

{

if(fronta==-1)

{

printf("Can't return from an empty queue\n");

return -1;

}

return A[fronta];

}

void print()

{

int counta=(rear+MAX_SIZE-fronta)%MAX_SIZE+1;

printf(" Queue: ");

int i;

for(i=0; i<counta; i++)

{

int index=(fronta+i)%MAX_SIZE;

printf("%d ",A[index]); //Index of element while traaversing circulrly from front

}

printf("\n");

}

int main()

{

Enqeue(2);

print();

Enqeue(4);

print();

Enqeue(6);

print();

Enqeue(8);

print();

Dequeue();

print();

Enqeue(8);

print();

return 0;

}

Leave a comment

Posted in A ll Codes, Algorithm, C, C Refresh, Queue

Tagged queue

Stack

Posted on March 17, 2017 | Leave a comment

Vid:
https://www.youtube.com/watch?v=sFVxsglODoo
Code:
Array Implementation:

#include<iostream>
using namespace std;
#define MAX_SIZE 101
int A[MAX_SIZE];
int top=-1; //top==index of array
void push(int x){
//top++;
//A[top]=x;
if(top==MAX_SIZE-1){
    cout<<"Stack Overflow";
    return;
}
A[++top]=x; //here pre increment operator is using
}
void pop()
{
    if(top==-1){
        cout<<"No element to return";
        return;
    }
    top--;
}
int Top()
{
    return A[top];
}
void print()
{
    cout<<"Stack:";
    for(int i=0; i<=top; i++){
    cout<<" "<<A[i]<<" ";
    }
 cout<<endl;

}
int main()
{
push(2);print();
push(1);print();
push(7);print();
pop();print();
pop();print();
push(10);print();
}

#include<iostream>

using namespace std;

#define MAX_SIZE 101

int A[MAX_SIZE];

int top=-1; //top==index of array

void push(int x){

//top++;

//A[top]=x;

if(top==MAX_SIZE-1){

cout<<"Stack Overflow";

return;

}

A[++top]=x; //here pre increment operator is using

}

void pop()

{

if(top==-1){

cout<<"No element to return";

return;

}

top--;

}

int Top()

{

return A[top];

}

void print()

{

cout<<"Stack:";

for(int i=0; i<=top; i++){

cout<<" "<<A[i]<<" ";

}

cout<<endl;

}

int main()

{

push(2);print();

push(1);print();

push(7);print();

pop();print();

push(10);print();

}

OOP Implementation with Array:

#include<iostream>
using namespace std;
#define MAX_SIZE 101
class Stack{
private:
int A[MAX_SIZE];
int top; //top==index of array
public:
    Stack(){
        top=-1;
    }
    void push(int x)
    {
        if(top==MAX_SIZE-1){
            cout<<"err: stackoverflow";
            return;
        }
        A[++top]=x;
    }
    void pop()
    {
        if(top==-1)
        {
            cout<<"No element to pop";
            return;
        }
        top--;
    }
    int Top(){
        return A[top];
    }
    int IsEmpty(){
        if(top==-1)
            return 1;
        return 0;
    }
    void print(){
        int i;
        cout<<"Stack: ";
        for(i=0;i<=top;i++){
            cout<<A[i]<<" ";
        }
        cout<<endl;
    }
};

int main(){
    Stack S;
    S.push(2);S.print();
    S.push(5);S.print();
    S.push(10);S.print();
    S.pop();S.print();
    S.pop();S.print();
    S.push(18);S.print();
}

#include<iostream>

using namespace std;

#define MAX_SIZE 101

class Stack{

private:

int A[MAX_SIZE];

int top; //top==index of array

public:

Stack(){

top=-1;

}

void push(int x)

{

if(top==MAX_SIZE-1){

cout<<"err: stackoverflow";

return;

}

A[++top]=x;

}

void pop()

{

if(top==-1)

{

cout<<"No element to pop";

return;

}

top--;

}

int Top(){

return A[top];

}

int IsEmpty(){

if(top==-1)

return 1;

return 0;

}

void print(){

int i;

cout<<"Stack: ";

for(i=0;i<=top;i++){

cout<<A[i]<<" ";

}

cout<<endl;

}

};

int main(){

Stack S;

S.push(2);S.print();

S.push(5);S.print();

S.push(10);S.print();

S.pop();S.print();

S.push(18);S.print();

}

Practice Problem:
http://www.mycodeschool.com/problems/stock-market

Leave a comment

Posted in A ll Codes, Data Structure, Stack

Tagged stack

DS Journery of my Alone

Posted on March 11, 2017 | Leave a comment

We learn data structure to organize data to manipulate data.

Leave a comment

Posted in Algorithm, Data Structure

Some Data Structure Basics To Know

Posted on December 31, 2015 | Leave a comment

https://www.youtube.com/watch?v=HdFG8L1sajw&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=2

Leave a comment

Posted in Data Structure

Tagged Some Data Structure Basics To Know

Category Archives: Data Structure

ArrayList in Java

Algo – Linked List

Algo DS: Circular Queue

Data Structure: Queue

Stack

DS Journery of my Alone

Some Data Structure Basics To Know

Categories

Random Quote

Random Quotes

My Facebook

Recent Posts

Archives

About Me & MyBlog

Caution and Tips:

Recent Comments

Category Archives: Data Structure

ArrayList in Java

Algo – Linked List

Algo DS: Circular Queue

Data Structure: Queue

Stack

DS Journery of my Alone

Some Data Structure Basics To Know

Categories

Random Quote

Random Quotes

Tags

My Facebook

Recent Posts

Archives

About Me & MyBlog

Caution and Tips:

Recent Comments