arraytree.inc

enum{ TREE_DATA = 3 };
enum{ TREE_SIZE = 2 << TREE_DATA };
/// 0 is root node
/// odd  numbers above 0 are left nodes.
/// even numbers above 0 are right nodes.
enum struct ArrayTree {
	int data[TREE_SIZE];
	
	/// -1 0 1
	int IndexType(int i) {
		if( i==0 ) {
			return i;
		} else if( index & 1 ) {
			return -1;
		}
		return 1;
	}
	
	int GetRightChild(int i) {
		return (2*i) + 2;
	}
	
	int GetLeftChild(int i) {
		return (2*i) + 1;
	}
};