No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
 | [CODE]#include <iostream> using namespace std; template<class L> class LEST { L *date; int first; int last; public: LEST(int last); L dele(); bool Full(); bool Empty(); bool Add(L value); bool search(L value); void print(); }; template<class L> LEST<L>::LEST(int last) { this->last = last>0 ? last:100; first-1; date = new L(this->last); } … |
| | [CODE]#ifndef NODE_BINARIO_H #define NODE_BINARIO_H # include "Colacircular.h" # include <iostream> using namespace std; template<class T> struct Node_Binario // struct of node { T Dato; Node_Binario<T> *left; Node_Binario<T> *right; int Profundida; }; template<class T> // class tree class Arbol { public: Arbol(); //constructor bool Insert(Node_Binario<T> * raiz,T item); // funtion insert … |