name: Tree<TObject>

synopsis:


g++ [flags ...] file ... -l /isip/tools/lib/$ISIP_BINARY/lib_dstr_a

#include <Tree.h>

TreeNode<TObject>* getRoot() const;
TreeNode<TObject>* insert(TObject* obj);
boolean insertChild(TreeNode<TObject>* pnode, TreeNode<TObject>* cnode);
boolean remove();
boolean remove(TObject*& obj);
boolean find(const TObject* obj);
boolean find(const TreeNode<TObject>* node);
boolean contains(const TObject* obj) const;
boolean contains(const TreeNode<TObject>* node) const;
boolean get(Vector<Ulong>& root_adj, SingleLinkedList<TObject>& node_obj, SingleLinkedList<Vector<Ulong> >& node_adj);
boolean set(Vector<Ulong>& root_adj, SingleLinkedList<TObject>& node_obj, SingleLinkedList<Vector<Ulong> >& node_adj);
DstrBase::ALLOCATION getAllocationMode() const;
boolean setAllocationMode(DstrBase::ALLOCATION alloc);
boolean postorderTreeTraversal(SingleLinkedList<TreeNode<TObject> >& arg);
boolean preorderTreeTraversal(SingleLinkedList<TreeNode<TObject> >& arg);
boolean inorderTreeTraversal(SingleLinkedList<TreeNode<TObject> >& arg);
boolean levelorderTreeTraversal(SingleLinkedList<TreeNode<TObject> >& arg);

quick start:


Char* char_a = new Char('a');
Char* char_b = new Char('b');

Tree<Char> tree_00;

tree_00.insertChild(tree_00.getRoot(), tree_00.insert(char_a));
tree_00.insertChild(tree_00.getRoot(), tree_00.insert(char_b));

delete char_a;
delete char_b;

description:

This class implements a generic Tree data structure using the left child right sibling representation. this class uses the double linked list class in USER mode since this list is used to store either the actual data or a pointer to it.

dependencies:

public constants:

define public constants:

static const String CLASS_NAME;

static const String DEF_PARAM;

error codes:

none.

protected data:

the allocation mode:

DstrBase::ALLOCATION alloc_d;

define the root of the tree:

TreeNode<TObject> root_d;

declare the debugging parameters:
```
static Integral::DEBUG debug_level_d;
```
declare the memory manager:
```
static MemoryManager mgr_d;
```

required public methods:

static methods:
```
static const String& name();
```

debug methods:

static boolean setDebug(Integral::DEBUG debug_level);

boolean debug(const unichar* msg) const;

destructor/constructor(s):

~Tree();

Tree(DstrBase::ALLOCATION alloc = DstrBase::DEF_ALLOCATION);

Tree(const Tree<TObject>& copy_Tree);

not present.

assign methods:

boolean assign(const Tree<TObject>& copy_stack);

operator= method:

Tree<TObject>& operator=(const Tree<TObject>& arg);

i/o methods:

long sofSize() const;

boolean read(Sof& sof, long tag);

boolean write(Sof& sof, long tag) const;

boolean read(Sof& sof, long tag, const String& name);

boolean write(Sof& sof, long tag, const String& name) const;

boolean readData(Sof& sof, const String& pname = DEF_PARAM, long size = SofParser::FULL_OBJECT, boolean param = true, boolean nested = true);

boolean writeData(Sof& sof, const String& pname = DEF_PARAM) const;

equality methods:

boolean eq(const Tree<TObject>& arg) const;

memory management methods:

static void* operator new(size_t size);

static void* operator new[](size_t size);

static void operator delete(void* ptr);

static void operator delete[](void* ptr);

static boolean setGrowSize(long grow_size);

boolean clear(Integral::CMODE cmode = Integral::DEF_CMODE);

class-specific public methods:

tree access methods:
```
TreeNode<TObject>* getRoot() const;
```

tree insert methods:

TreeNode<TObject>* insert(TObject* obj);

boolean insertChild(TreeNode<TObject>* pnode, TreeNode<TObject>* cnode);

tree remove methods:

boolean remove();

boolean remove(TObject*& obj);

tree find methods:

boolean find(const TObject* obj);

boolean find(const TreeNode<TObject>* node);

tree contains methods:

boolean contains(const TObject* obj) const;

boolean contains(const TreeNode<TObject>* node) const;

tree structure manipulation methods:

boolean get(Vector<Ulong>& root_adj, SingleLinkedList<TObject>& node_obj, SingleLinkedList<Vector<Ulong> >& node_adj);

boolean set(Vector<Ulong>& root_adj, SingleLinkedList<TObject>& node_obj, SingleLinkedList<Vector<Ulong> >& node_adj);

tree allocation mode methods:

DstrBase::ALLOCATION getAllocationMode() const;

boolean setAllocationMode(DstrBase::ALLOCATION alloc);

tree traversal methods:

boolean postorderTreeTraversal(SingleLinkedList<TreeNode<TObject> >& arg);

boolean preorderTreeTraversal(SingleLinkedList<TreeNode<TObject> >& arg);

boolean inorderTreeTraversal(SingleLinkedList<TreeNode<TObject> >& arg);

boolean levelorderTreeTraversal(SingleLinkedList<TreeNode<TObject> >& arg);

double linked list methods:

using DoubleLinkedList< TreeNode<TObject> >::length;

using DoubleLinkedList< TreeNode<TObject> >::gotoFirst;

using DoubleLinkedList< TreeNode<TObject> >::gotoNext;

using DoubleLinkedList< TreeNode<TObject> >::gotoPrev;

using DoubleLinkedList< TreeNode<TObject> >::getCurr;

using DoubleLinkedList< TreeNode<TObject> >::getFirst;

using DoubleLinkedList< TreeNode<TObject> >::getLast;

using DoubleLinkedList< TreeNode<TObject> >::gotoMark;

using DoubleLinkedList< TreeNode<TObject> >::setMark;

using DoubleLinkedList< TreeNode<TObject> >::gotoPosition;

using DoubleLinkedList< TreeNode<TObject> >::getPosition;

using DoubleLinkedList< TreeNode<TObject> >::isLast;

using DoubleLinkedList< TreeNode<TObject> >::isEmpty;

using DoubleLinkedList< TreeNode<TObject> >::isMarkedElement;

private methods:

declare private methods:

boolean postorderTreeIterator(Stack<TreeNode<TObject> >& stack);

boolean preorderTreeIterator(Stack<TreeNode<TObject> >& stack);

boolean inorderTreeIterator(TreeNode<TObject>* parent, Queue<TreeNode<TObject> >& queue);

boolean levelorderTreeIterator(SingleLinkedList<TreeNode<TObject> >& arg, Queue<TreeNode<TObject> >& queue);

template <class TObject_diagnose> friend class TreeDiagnose;

examples:

none.

notes:

none.