TBtree

class TBtree : public TSeqCollection

    private:

      void Init(Int_t i)
      void RootIsEmpty()
      void RootIsFull()

    protected:

       void DecrNofKeys()
      Int_t IdxAdd(const TObject& obj)
       void IncrNofKeys()

    public:

                         TBtree(Int_t ordern = 3)
                 virtual ~TBtree()
            virtual void Add(TObject* obj)
            virtual void AddAfter(TObject*, TObject* obj)
            virtual void AddAt(TObject* obj, Int_t)
            virtual void AddBefore(TObject*, TObject* obj)
            virtual void AddFirst(TObject* obj)
            virtual void AddLast(TObject* obj)
        virtual TObject* After(TObject* obj) const
        virtual TObject* At(Int_t idx) const
        virtual TObject* Before(TObject* obj) const
          static TClass* Class()
            virtual void Clear(Option_t* option)
            virtual void Delete(Option_t* option)
        virtual TObject* FindObject(const TObject* obj) const
        virtual TObject* FindObject(const char* name) const
        virtual TObject* First() const
       virtual TObject** GetObjectRef(const TObject*) const
         virtual TClass* IsA() const
        virtual TObject* Last() const
      virtual TIterator* MakeIterator(Bool_t dir = kIterForward) const
                TObject* operator[](Int_t i) const
                   Int_t Order()
                   Int_t Rank(const TObject* obj) const
        virtual TObject* Remove(TObject* obj)
            virtual void ShowMembers(TMemberInspector& insp, char* parent)
            virtual void Streamer(TBuffer& b)
                    void StreamerNVirtual(TBuffer& b)

Data Members

    private:

      TBtNode* fRoot               root node of btree
         Int_t fOrder              the order of the tree (should be > 2)
         Int_t fOrder2             order*2+1 (assumes a memory access is
         Int_t fInnerLowWaterMark  inner node low water mark
         Int_t fLeafLowWaterMark   leaf low water mark
         Int_t fInnerMaxIndex      maximum inner node index
         Int_t fLeafMaxIndex       maximum leaf index

Class Description