Binary tree algorithms can be complicated: Are they worth the effort? Recall the characteristics of sort algorithms that use a binary divide and conquer technique.

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?