Tree Class

Environment: all

Class for presenting tree structures in C++.

1. Data objects:
- The purpose of the Data class is to keep the actual data. It keeps the data until all actual references to it are dead. This is done with reference counting (COM like). I know somebody may find this worthless and useless, but it makes the data more capsulated and secure. The implementation is divided in two classes Data and Ref (reference). All the data is stored in the Data class.All the job is done by Ref class, which manipulates the data class.

template <class Type> class Data {
private:
...// all methods  vars are private
   friend class Ref<Type>; // Ref class will manipulate us
};
template <class Type> class Ref {
    Ref(Type *p);
    Ref();
    Ref(const Ref<Type> rhs);
    //destructor
    virtual ~Ref();

//operators =
    Ref operator=(const Ref<Type> rhs);
    Ref operator=(const Type t);
    Ref operator=(Type *p); 
// operator ==
    bool operator==(const Ref<Type> rhs) 
// misc

Ref Clone();
    void Release();
    bool IsNull();

// accessors to the actual data 
// (check if it's null first)
    Type *operator->();
    Type get_Data();
    operator Type();
}

2. Tree object:
- Tree class represents a node in the tree, so it has parent and it has children. in this way i use a single class for representing a node and a tree, so the the tree is a node without praent. It also has reference (Ref) to the data. It's implementation is divided between two classes NodeData and Tree. NodeData objects holds the actual data for the parent and the children, but Tree object manipualtes this data and gives access to them. Actually you'll always use only Tree class directly.

- definitions
- node - a simple node or leaf in the tree
- leaf - a node without children
- root (tree) - a node without parent (i.e. prent is Null)
- Null - null node

template <class Type> class NodeData {
private:
    .... // all methods  vars are private
    friend class Tree<Type>;
}

template <class Type> class Tree {
public:
    // we'll call the tree node
    typedef Tree<Type> Node;
    
    // parent
    Node Parent();
    
    // children - Nodes
    __declspec( property( get=get_Nodes) ) Node Nodes[];
    __declspec( property( get=get_Count) ) int Count;

    Node get_Nodes(int nIndex);
    int get_Count();
    
    // data acess
    __declspec( property( get=get_Data) ) Ref<Type> Data;

    operator Type();
    Type *operator->();
    Ref<Type> get_Data();

    // node functions (isLeaf and so on
    bool IsLeaf();
    bool IsNode();
    bool IsRoot();

    // comparision
    bool operator == (const Node rhs)
          { return *(NodeBase*)this==(NodeBase )rhs;};

    // node operations
    Node AddNode(const Type t); 
    void Delete();
    void DeleteNode(int nIndex);
    void DeleteNode(Node node);

    // constructors
    Tree(const Type Data);
    Tree(Type *Data);
    
    Tree();
    Tree(const Tree<Type> rhs);
    Tree(const NodeBase rhs);
    
    // destructor
    virtual ~Tree();
}

3. Simple usage:

// function for printing nodes
void PrintNode(StringNode node,int nLevel) {
    // print new line
    fputs("\n",stdout);
    // print spaces for indent (2 for every level)
    string s;
    s.resize(nLevel*2,' ');
    fputs(s.c_str(),stdout);

    // print the value
    fputs(node.get_Data()->c_str(),stdout);

    // iterate through children
    nLevel++;
    for(int n=0;n<node.Count;n++) {
        PrintNode(node.Nodes[n],nLevel);
    }
}

int main(int argc, char* argv[])
{
    // define the tree
    StringTree tree; 
    ((string)tree)="Root";

    //add few nodes
    StringNode node=tree;

    node.AddNode("1").AddNode("11");
    StringNode node2=node.AddNode("2");

    node2.AddNode("21").AddNode("211");
    node2.AddNode("22");
    node2.AddNode("23");
    
    node.AddNode("3");

    // print the tree
    PrintNode(tree,0);

    // wait for enter
    char buf[3];
    fputs("\nPress ENTER :",stdout);
    fgets(buf,3,stdin);
    return 0;
}
4. Contact me if you have comments and opinions (mailto:akovache@san.rr.com )

Downloads

Download source & demo project - 5 Kb


Comments

  • Click here

    Posted by Legacy on 09/04/2002 12:00am

    Originally posted by: TigranG

    Very poor functionality. It is almost useless.

    Reply
  • ^Great

    Posted by Legacy on 06/04/2002 12:00am

    Originally posted by: venkaesh

    Very good project

    and
    I need to practice my programming if I ever plan to get good, only problem is I
    can't think of any challenging exercises I could write. If you know any websites or you
    yourself want to see something written could you please tell me. Thanks

    Reply
  • Nice but there are some problems

    Posted by Legacy on 01/15/2002 12:00am

    Originally posted by: Zhonghua Yi

    sample code:
    
    

    Tree<int> tree;
    ((int&)tree) = 0;

    Tree<int>::Node node = tree;
    node.AddNode(1);//error!

    reason:
    Type is int, so it can't distinguish the two structor:
    Ref(KEY key).. and Ref(const Type& t)...

    Ref(const Type& t) is the right structor, but in fact, Ref(KEY key) is called.


    Reply
  • seems good but why all this __declspec stuff?

    Posted by Legacy on 01/14/2002 12:00am

    Originally posted by: Earl Purple

    which is Microsoft Specific.

    Surely it would be better to make the whole thing platform-independent.

    Reply
  • gut code

    Posted by Legacy on 01/11/2002 12:00am

    Originally posted by: anand paranjpe

    nice code with explanation

    Reply
  • Tree Class ...wunderbar

    Posted by Legacy on 01/11/2002 12:00am

    Originally posted by: anand

    fantastisch!!zehr gut..

    Reply
  • Very Good!

    Posted by Legacy on 01/11/2002 12:00am

    Originally posted by: 中华易

    Thank you!
    

    Reply
  • Thanks!

    Posted by Legacy on 01/10/2002 12:00am

    Originally posted by: Rob

    I've just wanted to do the same. Thanks!

    Reply
Leave a Comment
  • Your email address will not be published. All fields are required.

Top White Papers and Webcasts

  • IBM Worklight is a mobile application development platform that lets you extend your business to mobile devices. It is designed to provide an open, comprehensive platform to build, run and manage HTML5, hybrid and native mobile apps.

  • On-demand Event Event Date: October 23, 2014 Despite the current "virtualize everything" mentality, there are advantages to utilizing physical hardware for certain tasks. This is especially true for backups. In many cases, it is clearly in an organization's best interest to make use of physical, purpose-built backup appliances rather than relying on virtual backup software (VBA - Virtual Backup Appliances). Join us for this webcast to learn why physical appliances are preferable to virtual backup appliances, …

Most Popular Programming Stories

More for Developers

Latest Developer Headlines

RSS Feeds