Hi Steward, I would choose LinkedList or Vector to implement a tree data structure, generally speaking, both of them work fairly well for binary tree/binary search tree/AVL tree/fibonacci tree/b tree/b* tree(use double LinkedList here)/suffix tree/game tree etc. I don�t quite understand the "store" you mentioned here. Because usually when the tree is being generated, both its innern notes and leaves are stored in the LinkedListed or Vector. Could you please offer some further specification? I guess you wanted to visit all the notes in the tree ?
Regards, Ellen [ January 31, 2003: Message edited by: Ellen Fu ]
I’ve looked at a lot of different solutions, and in my humble opinion Aspose is the way to go. Here’s the link: http://aspose.com