-------------------------------void insert(key, data){

if(table[key] == (null || 0)){

table[key] = data;
}
else{
insert(key+1, data);
}
}
void remove(key, data){
if(table[key] == data){
table[key] = 0;
}
else{
remove(key+1, data);
}
}
-----------------------------Tree arrayToTree(array){
int root = array[array.length/2];
int left[] = int[array.length/2];
int right[] = int[array.length/2];
for(int i = 0; i<array.length/2; i++){
left[i] = array[i];
}
for(int i = array.lenght/2; i<array.length; i++){
right[i] = array[i];
}
Tree tree = new Tree(root ,arrayToTree(left), arrayToTree(right));
return tree;
}
-------------------------------------#ifndef FILA_H
#define FILA_H
#include <stack>
using namespace std;
template <class T>
class Fila{
private:
stack<T>* pilha1;
stack<T>* pilha2;
public:
Fila<T>(){
pilha1 = new stack<T>();
pilha2 = new stack<T>();
}
void push_back(T elem){
pilha1->push(elem);
}
void pop_front(){

if (pilha2->empty()){
while(!pilha1->empty()){
pilha2->push(pilha1->top());
pilha1->pop();
}
}
pilha2->pop();
while(!pilha2->empty()){
pilha1->push(pilha2->top());
pilha2->pop();
}
}
void print(){
string str = "";
if(pilha2->empty()){
while(!pilha1->empty()){
pilha2->push(pilha1->top());
pilha1->pop();
}
}
if (pilha1->empty()){
while(!pilha2->empty()){
cout<<pilha2->top()<<" ";
pilha1->push(pilha2->top());
pilha2->pop();
}
}
cout<<endl;
}
bool empty(){
return (pilha1->empty()&&pilha2->empty());
}
};
#endif // FILA_H
------------------------------------------#ifndef FILA2_H
#define FILA2_H
#include <stack>
using namespace std;
template <class T>
class Fila2{
private:
stack<T>* pilha;
public:
Fila2() {
pilha = new stack<T>();
}
void push_back(T elem){

T aux;
if(pilha->empty()){
pilha->push(elem);
}
else{
aux = pilha->top();
pilha->pop();
push_back(elem);
pilha->push(aux);
}
}
void pop_front(){
pilha->pop();
}
void print(){
T aux;
aux = pilha->top();
cout<<aux<<" ";
pilha->pop();
if(!pilha->empty()){
print();
}
pilha->push(aux);
}
};
#endif // FILA2_H