Basic skeleton code with working test case.
Implementation must be in header file, but can be outside the class def.
Restructure, from scratch.

Node is the base class, RTree inherits from Node. No need for abstract
base class, tree.h is deprecated. R+-Tree and R*-Tree can inherit from
RTree. Working base code gives some output for proof of basic data
structures.
Code Compiles

Implementation of search and a basic insert. Not at a stage where these
can be properly tested.
Some things are working

Working insert and handles splitting the node if it overflows. The
second insert after this hangs the program. The tree can be output
validating the split. There is now functionality to calculate the MBR
from a list of points (entries). Max and min within this function are
currently doubles, this locks the tree class to numerical data, this
might not be a problem.
Added insert functionality and MBR subtraction.

MBR subtraction works from rectangle areas. Can now insert into leaf
nodes by extending the MBR from its parent. New entry is inserted into
node requiring the smallest increase in MBR area.
Added Description to Output.

The executable now describes what is happenening at each insert.
MBR is now calculated when node is split down the tree.

A flag has been added (defaults to false) to specify the re-calculation
of the nodes MBR in its parent.
Minor changes - Tidy up
Merge branch 'master' of github.com:TimButters/TTrexx