| | | | | |

Associative Arrays using BST technology

Apply all algorithms to key and/or data instead of tval

    void Put (const KeyType& k , const DataType& d)
    {
      Get(k) = d;
    }

    D& Get (const KeyType& k)
    {
      Node * location;
      root_ = RGet(root_,k,location);
      root_->SetBlack();
      return location -> data_;
    }

| | Top of Page | 12. Binary Search Trees - 40 of 41