Colas 1

import java.util.*;

public class colas{

public static void main (String[] args) {

Queue<Integer> cola = new LinkedList<>();

System.out.println(cola.isEmpty()); //Verifica si la cola esta vacia

System.out.println(cola.size()); //Obtener el tamaño de la cola

cola.add(5); // insertar un elemento en la cola

System.out.println("Dato: "+cola.peek()); // obtiene el valor de un elemento

System.out.println(cola.isEmpty());

System.out.println(cola.size());

cola.remove(); // Eliminar un elemento

System.out.println(cola.isEmpty());

System.out.println(cola.size());

for(int i=5;i<10;i++){

cola.add(i);

while( !cola.isEmpty() ){

System.out.println(cola.peek());

cola.remove();

Cola 2

#include <iostream>

#include <queue>

using namespace std;

int main(int argc, char **argv)

{
queue<int> cola, cola2; // crear la cola

cout<<"Crear variable"<<endl;

cout<<"Empty: "<<cola.empty()<<endl;

cout<<"Size: "<<cola.size()<<endl;

cout<<"Insertar un valor"<<endl;

cola.push(10); //inserta un valor

cout<<"Empty: "<<cola.empty()<<endl;

cout<<"Size: "<<cola.size()<<endl;

cola.pop(); // elimina un valor

cout<<"Eliminar un valor"<<endl;

cout<<"Empty: "<<cola.empty()<<endl;

cout<<"Size: "<<cola.size()<<endl;

cout<<"Insertar un valor"<<endl;

cola.push(17); //inserta un valor

cout<<"Empty: "<<cola.empty()<<endl;

cout<<"Size: "<<cola.size()<<endl;

cout<<cola.front()<<endl;

for(int i=1;i<6;i++){

cola.push(i);

cout<<"Recorrer una cola"<<endl;

//Recorrido de la Cola

cola2 = cola;

queue<int> cola3(cola2);

while( !cola.empty() ){

cout<<"Valor: "<<cola.front()<<endl;

cola.pop();

cout<<"Empty: "<<cola.empty()<<endl;
 cout<<"Size: "<<cola.size()<<endl;

cout<<"Empty: "<<cola3.empty()<<endl;

cout<<"Size: "<<cola3.size()<<endl;

return 0;

Lista3

include <iostream>

#include <queue>

using namespace std;

int main(int argc, char **argv)

queue<int> cola, cola2; // crear la cola

cout<<"Crear variable"<<endl;

cout<<"Empty: "<<cola.empty()<<endl;

cout<<"Size: "<<cola.size()<<endl;

cout<<"Insertar un valor"<<endl;

cola.push(10); //inserta un valor

cout<<"Empty: "<<cola.empty()<<endl;

cout<<"Size: "<<cola.size()<<endl;

cola.pop(); // elimina un valor

cout<<"Eliminar un valor"<<endl;

cout<<"Empty: "<<cola.empty()<<endl;

cout<<"Size: "<<cola.size()<<endl;

cout<<"Insertar un valor"<<endl;

cola.push(17); //inserta un valor

cout<<"Empty: "<<cola.empty()<<endl;

cout<<"Size: "<<cola.size()<<endl;
 cout<<cola.front()<<endl;

for(int i=1;i<6;i++){

cola.push(i);

cout<<"Recorrer una cola"<<endl;

//Recorrido de la Cola

cola2 = cola;

queue<int> cola3(cola2);

while( !cola.empty() ){

cout<<"Valor: "<<cola.front()<<endl;

cola.pop();

cout<<"Empty: "<<cola.empty()<<endl;

cout<<"Size: "<<cola.size()<<endl;

cout<<"Empty: "<<cola3.empty()<<endl;

cout<<"Size: "<<cola3.size()<<endl;

return 0;

Eji

include <iostream>

#include <stack>

#include <queue>

using namespace std;

//Mostrar una pila y una cola con nombres

int main(int argc, char **argv){

string s;
 int n;

cin>>n;

stack<string> p;

queue<string> c;

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

cin>>s;

p.push(s);

c.push(s);

cout<<"Recorrido de la Pila"<<endl;

while( !p.empty() ){

cout<<p.top()<<endl;

p.pop();

cout<<"Recorrido de la Cola"<<endl;

while( !c.empty() ){

cout<<c.front()<<endl;

c.pop();

return 0;

include <iostream>

#include <stack>

#include <cmath>

using namespace std;

//Hallar la distancia de todos los puntos en coordenadas x,y con respecto al origen
struct point{

int x;

int y;

};

float distancia(int x, int y){

return sqrt(x*x+y*y);

int main(int argc, char **argv){

stack<point> p;

int n, x, y;

cout<<"N?: "<<endl;

cin>>n;

point aux;

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

cout<<"Punto X: ";

cin>>x;

cout<<"Punto Y: ";

cin>>y;

aux.x=x;

aux.y=y;

p.push(aux);

while( !p.empty() ){

cout<<"Distancia: "<<distancia(p.top().x, p.top().y )<<endl;

p.pop();

return 0;
}

import java.util.*;

import java.util.Stack;

public class EjemploStack{

public static void main (String[] args) {

Stack<Integer> pila = new Stack<>();

Stack<Integer> pila2 = new Stack<>();

System.out.println(pila.isEmpty());

pila.push(1);

System.out.println(pila.isEmpty());

pila.pop();

System.out.println(pila.isEmpty());

for(int i=3;i<10;i++){

pila.push(i);

/*

while( !pila.isEmpty() ){

System.out.println(pila.peek());

pila.pop();

}*/

Iterator<Integer> itr = pila.iterator();

while(itr.hasNext()){

Integer dato = itr.next();

System.out.println(dato);

System.out.println(pila);

}
#include <iostream>

#include <stack>

using namespace std;

int main(int argc, char **argv){

stack<char> pila;

string cadena;

cin>>cadena;

for(int i=0;i<(int)cadena.length();i++){

pila.push( cadena.at(i) );

while( !pila.empty() ){

cout<<pila.top();

pila.pop();

return 0;

include <iostream>

#include <queue>

using namespace std;

int main(int argc, char **argv)

queue<string> cola;

int n;

string nombre;

cin>>n;

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

cin>>nombre;
 cola.push(nombre);

while(!cola.empty()){

cout<<cola.front()<<endl;

cola.pop();

return 0;

Lista

include <iostream>

#include <list>

using namespace std;

int main(int argc, char **argv)

list<int> ls;

list<int> ls2;

cout<<"empty(): "<<ls.empty()<<endl;

cout<<"size(): "<<ls.size()<<endl;

cout<<"Insertar 1"<<endl;

ls.push_front(1); //Insertar por delante

cout<<"empty(): "<<ls.empty()<<endl;

cout<<"size(): "<<ls.size()<<endl;

cout<<"Insertar 2"<<endl;

ls.push_back(2);

cout<<"empty(): "<<ls.empty()<<endl;

cout<<"size(): "<<ls.size()<<endl;

ls.push_back(3);

ls.push_back(4);

ls.push_front(5);
ls.push_front(6);

list<int>::iterator it;

for(it=ls.begin();it!=ls.end();++it){

cout<<*it<<endl;

cout<<"size(): "<<ls.size()<<endl;

list<int>::reverse_iterator rit;

for(rit=ls.rbegin();rit!=ls.rend();++rit){

cout<<*rit<<endl;

cout<<"--------------"<<endl;

it=ls.begin();

++it;

ls.insert(it, 10);//insertar un valor en una posicion

ls.insert(it, 10);

ls.insert(it, 10);

ls.insert(it, 10);

for(it=ls.begin();it!=ls.end();++it){

cout<<*it<<endl;

cout<<"--------------"<<endl;

ls.unique();//Elimina dos valor contiguos iguales

for(it=ls.begin();it!=ls.end();++it){

cout<<*it<<endl;

cout<<"--------------"<<endl;

ls.sort();

for(it=ls.begin();it!=ls.end();++it){

cout<<*it<<endl;

cout<<"--------------"<<endl;
 cout<<ls.front()<<endl;//primer elemento de la lista

cout<<ls.back()<<endl; //ultimo elemento de la lista

cout<<"--------------"<<endl;

ls.pop_front();//Elimina el primero elemento

ls.pop_back();//Elimina el ultimo elemento

for(it=ls.begin();it!=ls.end();++it){

cout<<*it<<endl;

ls2.assign(ls.begin(),ls.end());

while(!ls.empty()){

cout<<ls.front()<<" ";

ls.pop_front();

cout<<endl;

cout<<"--------------"<<endl;

cout<<ls2.size()<<endl;

for(it=ls2.begin();it!=ls2.end();++it){

cout<<*it<<endl;

return 0;

Listas

import java.util.*;

public class listas{

public static void main (String[] args) {

List<Integer> lista = new ArrayList<Integer>();

System.out.println(lista.size());

System.out.println(lista.isEmpty());

System.out.println("-----------------------");
 lista.add(0, 4); //Agregar al principio

System.out.println(lista.size());

System.out.println(lista.isEmpty());

lista.add(1); // Agregar al Final

System.out.println("-----------------------");

System.out.println(lista.size());

System.out.println(lista.isEmpty());

lista.add(0, 5);

lista.add(0, 6);

lista.add(0, 7);

lista.add(1);

lista.add(2);

lista.add(3);

for (int i : lista) {

System.out.print(i+" ");

System.out.println();

for (int j = 0; j < lista.size(); j++) {

System.out.print(lista.get(j)+" ");

System.out.println();

for(int j = lista.size()-1; j >= 0; j--) {

System.out.print(lista.get(j)+" ");

System.out.println();

lista.remove(0); //eliminar el primer elemento

lista.remove(lista.size()-1); //eliminar el ultimo elemento

for (int j = 0; j < lista.size(); j++) {

System.out.print(lista.get(j)+" ");

System.out.println();
 Collections.sort(lista);

for (int i : lista) {

System.out.print(i+" ");

Lista……

def main(args):

lista = []

print(len(lista))

print(bool(lista))

print("------------")

lista.insert(0,1)

print(len(lista))

print(bool(lista))

print("------------")

lista.append(4)

print(len(lista))

print(bool(lista))

lista.insert(0,5)

lista.insert(0,6)

lista.append(1)

lista.append(2)

print(lista)

lista.pop(0)

lista.pop(len(lista)-1)

print(lista)

for x in reversed(lista):

print(x)
 lista.sort()

print(lista)

return 0

if __name__ == '__main__':

import sys

sys.exit(main(sys.argv))

Pilas…..

include <iostream>

#include <stack>

using namespace std;

int main(int argc, char **argv)

stack<int> pila;

cout<<"Tamaño Pila: "<<pila.size()<<endl;

cout<<"Vacio?: "<<pila.empty()<<endl;

//Insercion

pila.push(3);

cout<<"Tamaño Pila: "<<pila.size()<<endl;

cout<<"Vacio?: "<<pila.empty()<<endl;

cout<<"Insertar Varios Elementos"<<endl;

for(int i=3;i<8;i++){

cout<<"Elemento: "<<i<<endl;

pila.push(i);

cout<<"Tamaño Pila: "<<pila.size()<<endl;

cout<<"Vacio?: "<<pila.empty()<<endl;

cout<<"Recorrer la Pila"<<endl;

while( !pila.empty() ){
 cout<<"Elemento"<<endl;

cout<<pila.top()<<endl;

pila.pop();

return 0;

Pilas…..

#include <iostream>

#include <stack>

using namespace std;

int main(int argc, char **argv)

string s;

stack<char> p;

char c;

bool estado = true;

cout<<"Cadena?";

cin>>s;

for(int i=0;i<(int)s.length() && estado ;i++){

c = s.at(i);

if(c=='('){

p.push(c);

else{

if(p.empty()){

estado=false;

else{

p.pop();

}
 }

if(estado && p.empty()){

cout<<"SI"<<endl;

else{

cout<<"NO"<<endl;

return 0;