class LittleTree {
public:
   enum WhichVec {Left2, Right1, Right2} whichVector; //(sort tie-breaker), right must be greater than left
   const Point*       position;  //vector end
   LittleTree*        greater; //that is, further around to the right
   LittleTree*        lesser; //that is, less far around to the right

   LittleTree() {greater = lesser = NULL;}

   void readTree(WhichVec* at, int* ip)
   {
      if (lesser)
         lesser->readTree(at, ip);
      at[*ip] = whichVector;
      ++*ip;
      if (greater)
         greater->readTree(at, ip);
   }
   //walk the tree in order, filling an array
   void readTree(WhichVec* at)
   {
      int i = 0;
      readTree(at, &i);
   }
};

public class LittleTree
{
    public enum WhichVec { Left2, Right1, Right2 }
    public WhichVec whichVector; //(sort tie-breaker), right must be greater than left

    Vector2 position;  //vector end
    public LittleTree greater; //that is, further around to the right
    public LittleTree lesser; //that is, less far around to the right

    public void ReadTree(WhichVec at, int ip)
    {
        if (lesser != null)
            lesser.ReadTree(at, ip);
        at[ip] = whichVector;
        ++ip;
        if (greater != null)
            greater.ReadTree(at, ip);
    }

    //walk the tree in order, filling an array
    public void ReadTree(WhichVec at)
    {
        int i = 0;
        ReadTree(at, i);
    }
}