We are learning about binary search trees in my C++ class right now. This is one of the questions that we were asked. Any help with it would be appreciated:)

If each node of a tree is large (i.e., contains a large amount of data), then available memory may be a limiting factor. What can be done to allow an extremely large tree with hundreds of thousands (or even millions) of nodes to be built and managed?