Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "stdafx.h"
- #include<iostream>
- using namespace std;
- struct nodo
- {
- int valor;
- nodo*primero;
- nodo*siguiente;
- nodo*anterior;
- nodo*ultimo;
- };
- void agregar(int v, nodo* n)
- {
- if (n->valor == 0)
- {
- }
- else
- {
- }
- }
- void recorrer(nodo* n)
- {
- while (n != nullptr) {
- }
- }
- void buscar(int k, nodo*n)
- {
- while (n != nullptr)
- {
- lista" << "\n";
- break;
- lista" << "\n";
- }
- }
- void eliminar(int k, nodo*n)
- {
- while (n != nullptr)
- {
- }
- }
- int main()
- {
- nodo*n = new nodo();
- //n->valor = 5;
- agregar(5, n);
- agregar(3, n);
- agregar(36, n);
- agregar(8, n);
- eliminar(5,n);
- recorrer(n);
- system("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement