Klasa - drzewo (w tablicy). Przeciążenie operatorów wpisywania i wypisywania elementów

#include <iostream>
#include <cstdio>
typedef long long ll;
using namespace std;

class Tree {
public:
    int * TREE;
    static int firstpos;
    static int lastpos;
    Tree();
    Tree( int );
    ~Tree();
    void construct();
    void update( const int &, const int & );
};

int Tree::firstpos = 0;
int Tree::lastpos = 0;

Tree::Tree() { }

Tree::Tree( int number )
    : TREE( new int[ number << 1 ] )
{
    firstpos = number;
    lastpos = number << 1;
}

Tree::~Tree() {
    delete[] TREE;
}

void Tree::construct() {
    for( int i = firstpos - 1; i; i-- )
         TREE[ i ] = max( TREE[ i << 1 ], TREE[( i << 1 ) + 1 ] );
   
}

void Tree::update( const int & pos, const int & value ) {
    int i = firstpos + pos - 1;
    TREE[ i ] = value;
    for(; i > 1 && TREE[ i >> 1 ] < TREE[ i ]; i >> 1 )
         TREE[ i >> 1 ] = TREE[ i ];
   
}

int main() {
    int number, checks;
    cin >> number >> checks;
    Tree A( number );
    for( int i = 0; i < number; i++ )
         cin >> A.TREE[ i + A.firstpos ];
   
    A.construct();
}