senapk

#include <iostream>

using namespace std;

struct bnode{
    int value;
    bnode * left;
    bnode * right;
    bnode(int value = 0){
        this->value = value;

senapk

#ifndef SCREEN_H
#define SCREEN_H

#include <vector>
#include <iostream>
#include <sstream>

namespace std{

class screen

senapk

#include <iostream>
#include <cstdio>
#include <time.h>
#include "screen.h"

using namespace std;

#ifndef HASHTABLE_H
#define HASHTABLE_H

senapk

#include <iostream>

using namespace std;

struct snode{
    int value;
    snode * next;
    snode(int v = 0, snode * n = nullptr){
        value = v;
        next = n;

senapk

#include <iostream>

using namespace std;

struct bnode {
    int value;
    bnode * left{nullptr};
    bnode * right{nullptr};
    bnode(int v){
        value = v;

senapk

#ifndef BTREE_H
#define BTREE_H
#include <iostream>

using namespace std;


template <class T>
class bnode
{

senapk

#include <iostream>

struct snode{
    int value;
    snode * next;
    snode(int v = 0, snode * n = nullptr){
        value = v;
        next = n;
    }
};

senapk

#include <iostream>

using namespace std;

struct bnode{
    int value;
    bnode * left;
    bnode * right;
    bnode(int value = 0){
        this->value = value;

senapk

Prova Manhã.
1. 3 Pontos
2. 3.5 Pontos
3. 3.5 Pontos
4. 2 Pontos.

1.
    Hash.
        Memória: Maior uso de memória por alocar toda a tabela de espaço.
        Busca: tempo linear e constante, O(1), acesso direto por causa do hash.

senapk

TEMPLATE = app
CONFIG += console c++11
CONFIG -= app_bundle
CONFIG -= qt

LIBS += -lsfml-graphics -lsfml-window -lsfml-system
SOURCES += main.cpp