in a given language, my next self-inflicted pedagogical exarcise is to write some kind of recursive data structure representation of a binary tree.
The simple version of the data structure is something like:
struct Node { char * data; Node * left_child; Node * right_child; }; A few years ago as an exercise, I wrote a template version of an AVL
On Fri, 4 Jul 2003 12:32:16 -0700 "Steven T. Hatton" <hattons@globalsymmetry.com> wrote: tree (eg. a self balancing binary tree). In my tree there are 2 classes: The outer class, avltree, and an inner node. I think the STL provides a very good basic set of useful data structures, but they may not be sufficient for some uses. My implementation did not have iterators, and I'm not sure how I would implement an iterator in a binary tree. -- Jerry Feldman <gaf@blu.org> Boston Linux and Unix user group http://www.blu.org PGP key id:C5061EA9 PGP Key fingerprint:053C 73EC 3AC1 5C44 3E14 9245 FB00 3ED5 C506 1EA9