Hi,
I am implementing an B tree ADT. But I cannot figure out how to store an array of Pointers for the internal node of B tree.
I used a class called
template <class Object>
class OrderedList
to store the keys or records in a ORDERED LIST
But I cannot store pointers in a ORDERED LIST.
Any ideas how to create such a datastructure.
Thanks!
I am implementing an B tree ADT. But I cannot figure out how to store an array of Pointers for the internal node of B tree.
I used a class called
template <class Object>
class OrderedList
to store the keys or records in a ORDERED LIST
But I cannot store pointers in a ORDERED LIST.
Any ideas how to create such a datastructure.
Thanks!