Question

leafs

Asked by: valleytech

I want to calculate number of leafs  on a same level on a tree. Please give me hints on how to start. Tks a lot.

This Question has been solved and asker verified All Experts Exchange premium technology solutions are available to subscription members.

Subscribe now for full access to Experts Exchange and get

Instant Access to this Solution

  • Plus...
  • 30 Day FREE access, no risk, no obligation
  • Collaborate with the world's top tech experts
  • Unlimited access to our exclusive solution database
  • Never be left without tech help again

Subscribe Now

Asked On
2009-11-06 at 09:37:45ID24878680
Topic

C++ Programming Language

Participating Experts
2
Points
500
Comments
17

Trusted by hundreds of thousands everyday for fast, accurate and reliable tech support.

  • "The time we save is the biggest benefit of Experts Exchange to Warner Bros. What could take multiple guys 2 hours or more each to find is accessed in around 15 minutes on Experts Exchange." Mike Kapnisakis, Warner Bros.
  • "Our team likes having a resource that is more secure than just using Google and most experts using this service really know their stuff. It's nice to look here first versus using Google." Dayna Sellner, Lockheed Martin
  • "Anytime that I've been stumped with a problem, 9 out of 10 times Experts Exchange has either the accepted solution or an open discussion of the potential solution to the problem." Kenny Red, eBay Inc.

See what Experts Exchange can do for you.

Got a question?

We've got the answer.

Experts Exchange has been collecting answers to technology questions since 1996…3 million and counting! If you have a question, chances are we already have your answer.

Screenshot of Experts Exchange Knowledgebase

Need individual assistance?

Our experts are ready to help.

If you can't find the exact answer you're looking for, ask our exclusive community of 50,000 experts. You’ll get a personalized answer from a trusted professional.

Screenshot of Experts Exchange Knowledgebase

Want to learn from the best?

Read articles from industry experts.

Thousands of free tech tips, tricks, how-to’s and tutorials are available in our peer reviewed articles section. See for yourself how smart our experts are, no login required.

Screenshot of an Article

Working on a long term project?

Store your work and research.

Save solutions to your questions, answers you’ve discovered through searching plus helpful articles in your personal knowledgebase for easy future access.

Screenshot of Experts Exchange Knowledgebase

Access the answers to your technology questions today.

Subscribe Now

30-day free trial. Register in 60 seconds.

What Makes Experts Exchange Unique?

Members of the expert community talk about why the experience at Experts Exchange is different than what you will find anywhere else.

Trusted by the world's most respected brands.

image of each brand's logo

Faithfully serving IT professionals since 1996.

Experts Exchange Logo

Try it out and discover for yourself.

Subscribe Now

30-day free trial. Register in 60 seconds.

Related Solutions

  1. JTree problem with leaf and visibility!
    I have two problems: If I remove the last leaf from a node, this node automatically has the appearance of a leaf. Is there a way, that the node keeps his appearance as a node? I am able to set the roof of my JTree invisible but if I try to set a node invisible, nothing happ...
  2. EXPLoDING all leaf nodes
    How do I expand all leaf nodes in a JTree? in the documentation, the function ExpandPath() needs a TreePath as its input parameter... But I don't where to get a TreePAth object....
  3. Select 'leafs' in a hierarchical tree
    How do I select leafs (rows w/o child rows) from a table representing an hierarchical tree?
  4. Symbolic Link in leaf directories only...
    I have been trying to fix this myself as a learning exercise but I'm stuck again. Everything I do to try to fix it either totally breaks it or still includes non-leaf directories. so with this tree (imagine it was all the states with all the MSA's about 3200 directories): ....

Free Tech Articles

  1. WARNING: 5 Reasons why you should NEVER fix a computer for free.
    It is in our nature to love the puzzle. We are obsessed. The lot of us. We love puzzles. We love the challenge. We thrive on finding the answer. We hate disarray. It bothers us deep in our soul. W...
  2. SCCM OSD Basic troubleshooting
    SCCM 2007 OSD is a fantastic way to deploy operating systems, however, like most things SCCM issues can sometimes be difficult to resolve due to the sheer volume of logs to sift through and the dispe...
  3. Migrate Small Business Server 2003 to Exchange 2010 and Windows 2008 R2
    This guide is intended to provide step by step instructions on how to migrate from Small Business Server 2003 to Windows 2008 R2 with Exchange 2010. For this migration to work you will need the fo...
  4. Create a Win7 Gadget
    This article shows you how to create a simple "Gadget" -- a sort of mini-application supported by Windows 7 and Vista. Gadgets can be dropped anywhere on the desktop to provide instant information, ...
  5. Outlook continually prompting for username and password
    There have been a lot of questions recently regarding Outlook prompting for a username and password whilst using Exchange 2007. There are a few reasons why this would happen and I will try to cover t...
  6. Backup Exchange 2010 Information Store using Windows Backup
    There seems to be quite a lot of confusion around the ability to backup Exchange 2010 using the built in Windows Backup feature. This stems from the omission of this feature prior to Exchange 2007 s...

Cloud Class Webinars

  1. Avoiding Bugs in Microsoft Access
    Alison Balter takes and in-depth look at avoiding bugs in Access. In this webinar you will learn about using the immediate window to debug your applications, invoking the debugger, using breakpoints to troubleshoot, stepping through code, setting the next statement to execute, ...
  2. Top 10 Best New Features in Visio 2010
    Scott Helmers gives live demonstrations of the top 10 new features in Visio 2010. This webinar will teach you how to create compelling diagrams by adding shapes to the page with a single click, linking the shapes in a diagram to data in Excel (or SQL Server, or SharePoint), ...
  3. IT Consultant Business Secrets Revealed
    Michael Munger, Experts Exchange tech pro and IT consultant, pulls back the curtain on his very successful businesses and answers question on every IT consultant and business owner should know about. He shares secrets on what he did to solve the 5 most common problems in IT, ...
  4. Disaster Recovery and Business Continuity
    Quest CTO, Mike Billon, gives an overview of the steps involved in building a dunamic disaster recovery plan. Through case studies and an examination of software/hardware tooles for monitoring and testing, you'll gain a better understandin of where you are, where you want ...
  5. Organize Your Visio Diagrams with Containers and Lists
    Scott Helmers uses cross functional flowcharts, wireframe diagrams, data graphic legends and seating charts to teach you: how to ustilize all three new structured diagram components in Visio 2010, the best practices for organizeing shapes in previous version of Visio, how to organize ...
  6. How to Us Objects, Properties, Events and Methods in Microsoft Access
    Alison Dalter gives an in-depbth look at objects, properties, events and methods in Microsoft Access. In this webinar you will learn about using the object browser, referring to objects, working with properties and methods, working with object variables, understanding the ...

Join the Community

Give a Little. Get a Lot.

Join the community of experts here and help other tech pros by answering question in your area of expertise. You can earn FREE access to all Experts Exchange's premium features and resources.

Join the Community

Answers

 

by: itsmeandnobodyelsePosted on 2009-11-06 at 10:40:12ID: 25761774

It is a follow-up of   http:Q_24862961.html  where the last valid code was

#include <stdio.h>
#include <string>
#include <vector>
#include <fstream>
 
#include <iostream>
using namespace std;
 
 
struct TreeNode
{
    std::string key;
    std::vector<TreeNode> children;
};
 
class Tree
{
    // the one and only root node
    TreeNode root;
    ifstream fin; 
    ofstream fout;
 
public:  
    bool    ignoreStartTags();
    bool    parseXML();
    void    draw();
 
private:
    void    parseXMLNode(TreeNode &parentNode);
    string  readCurrentXmlTag();
    string  readCurrentXmlKey(string tag); 
    void    drawNode(TreeNode & parentNode, int indent);
    string & trim(std::string & s);
};
 
 
string & Tree :: trim(std::string & s)
{
    int len = (int)s.size();
    while (len > 0 && isspace(s[--len]))
           s.resize(len);
    return s;
} 
string Tree:: readCurrentXmlKey(string tag)
{
    string key;
    char array[200];
    int counter = 0; 
    string str;
 
    if( tag == "branch" || tag == "leaf")
    {
        counter = 3;
    }
    else if(tag =="attribute") 
    {
        counter = 2;
    }
    else if( tag == "/leaf")
    {
        counter = 0;
    }
 
    if( !fin.eof())
    {
        for(int i = 0; i < counter; i ++)
        {
            fin.getline(array,200);
            
            str = array; 
            if( str.empty())
            {
              //  cout<<"in break"<<endl;
                break;
            } 
            //cout<<"XmlKey-> read line : "<<array<<endl;
 
            if( i == 0)
            {
                char * pch;
                char delims[]= "=\"" ;           //"<=\">"; //get " must use \" to distingusih between newline and " 
 
                pch = strtok(array,delims);
              //  printf("1st~~~~~%s\n",pch);
                while(pch != NULL)
                {
                    if( strcmp(pch,"latin_name") ==0 ) 
                    {
                        pch = strtok(NULL,delims);
                      //  printf("2nd~~~~~%s\n",pch);
                        pch = strtok(NULL,delims);
                      //  printf("3rd~~~~~%s\n",pch);  
 
                        key = pch;
                        //cout<<Value<<endl;
                        break;
                    }
                    pch = strtok(NULL,delims);
 
                }//end of  strtok while
            }// end of if counter == 0
        }//end of for
       // cout<<"key is :"<<key<<endl;
 
    }// end of file    
    return key;
} 
bool Tree::ignoreStartTags()
{
    char array[1000]; 
    fin.open("Treeinput.txt",ios_base::in); 
    if (!fin) 
    {
        cout << "Fail to open file!!!."<< endl;
        return false;
    }
    else
    {
        // just ignore the first 8 lines
        for( int i = 0; i< 8; i++)
        {
            fin.getline(array,100);
        }
        return true;
    } 
} 
 
 
void Tree::drawNode ( TreeNode &parentNode, int indent)
{
    int i=0,j=0;
    indent ++;
     
    for( j =0; j <indent; j++)
    {
        cout<<"+"; 
        fout<<"+";
    } 
    cout<<"\""<<parentNode.key<<"\""<<"  "<<endl; 
    fout<<"\""<<parentNode.key<<"\""<<"  "<<endl; 
    if( parentNode.children.size()== 0)
    {
        return;
    }
    else
    {
        for(int i = 0; i <parentNode.children.size();i++)
        {
            drawNode(parentNode.children[i],indent);
        }
    }
}
 
 
void Tree::draw()
{
    int indent = 0;
    cout<<endl<<"start display tree"<<endl; 
    fout.open("Treeoutput.txt", ios::out ); 
    drawNode(root,indent); 
    fout.close();
}
 
bool Tree::parseXML() 
{
    string tag;
   //here in that function we put the loop you now have at begin of parseXMLNode
   //in case of read errors or missin g tags it return false
    
    if( !ignoreStartTags()) return false; 
    tag = readCurrentXmlTag(); 
    // read root key
    string key = readCurrentXmlKey(tag); 
    if( key.empty()) return false;
    root.key =key; 
    // now the root node is complete like any other parent node...
    parseXMLNode(root);
    return true;
} 
string Tree::readCurrentXmlTag()
{
    string Tag;
    char array[100];
    string str;
    
    if( !fin.eof())
    {
        fin.getline(array,100);
         
        str = array; 
        trim(str); 
        if( str.empty() || str == "/tree" || str == "  ")
        {
            return Tag;
        } 
        //cout<<endl<<"XmlTag-> read line : "<<array<<endl; 
        char tmp[100];
        strcpy(tmp,array);
 
        char * pch;
        char delims[]= "< >" ;          
 
        pch = strtok(array,delims);
        while(pch != NULL)
        {
            if( strcmp(pch,"branch")==0 || strcmp (pch,"/branch")== 0||
                strcmp(pch,"leaf")== 0 || strcmp (pch,"/leaf")== 0 || strcmp(pch,"attribute") == 0)
            {
                Tag = pch;   
                break;
            }
            pch = strtok(NULL,delims);
 
        }//end of  strtok while
        
        if(Tag =="/branch")
        {
          
          //  cout<<"--->Tag is /branch"<<endl;
        } 
        //cout<<"before return, Tag : "<<Tag<<endl;
        return Tag;
    }
    else
    {
        fin.close();
        //exit(1);
        return Tag;
    }  
}
void Tree::parseXMLNode( TreeNode &parentNode)
{
   // cout<<"Beginning of parseXMLNode"<<endl;
    string tag;
    string key;
    TreeNode child; 
    while(  (tag = readCurrentXmlTag()) != "/branch")
    {
        if(tag.empty() || tag == "/tree")
        {
            return;
        } 
        //cout<<"**tag is : "<<tag<<endl;  
        key = readCurrentXmlKey(tag);
   
        if( key.empty())
        {
            cout << "empty key after readCurrentXmlKey(" << tag << ") " << endl;
            return;
        }
        
        child.key = key;
        parentNode.children.push_back(child);
        
        if(tag == "branch")
        {
            TreeNode &childRef = parentNode.children.back(); 
            //draw();
            //cout<<"childRef key is "<<childRef.key<<endl;
            parseXMLNode(childRef);
        }
        else if( tag =="leaf")
        {
            //draw();
            tag == readCurrentXmlTag();
            if(tag == "/leaf")
            {
                continue;
            }
            else
            {
               // cout<<"****tag is :"<<tag<<endl;
               // cout<<"Missing /leaf tag"<<endl;
            }
        }
    }
    //cout<<"current parent is : "<<parentNode.key<<endl<<endl;
    return;
}
 
int main()
{
    Tree tree;
    tree.parseXML();
   
    tree.draw(); 
    
 
    return 1;
}
                                              
1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
21:
22:
23:
24:
25:
26:
27:
28:
29:
30:
31:
32:
33:
34:
35:
36:
37:
38:
39:
40:
41:
42:
43:
44:
45:
46:
47:
48:
49:
50:
51:
52:
53:
54:
55:
56:
57:
58:
59:
60:
61:
62:
63:
64:
65:
66:
67:
68:
69:
70:
71:
72:
73:
74:
75:
76:
77:
78:
79:
80:
81:
82:
83:
84:
85:
86:
87:
88:
89:
90:
91:
92:
93:
94:
95:
96:
97:
98:
99:
100:
101:
102:
103:
104:
105:
106:
107:
108:
109:
110:
111:
112:
113:
114:
115:
116:
117:
118:
119:
120:
121:
122:
123:
124:
125:
126:
127:
128:
129:
130:
131:
132:
133:
134:
135:
136:
137:
138:
139:
140:
141:
142:
143:
144:
145:
146:
147:
148:
149:
150:
151:
152:
153:
154:
155:
156:
157:
158:
159:
160:
161:
162:
163:
164:
165:
166:
167:
168:
169:
170:
171:
172:
173:
174:
175:
176:
177:
178:
179:
180:
181:
182:
183:
184:
185:
186:
187:
188:
189:
190:
191:
192:
193:
194:
195:
196:
197:
198:
199:
200:
201:
202:
203:
204:
205:
206:
207:
208:
209:
210:
211:
212:
213:
214:
215:
216:
217:
218:
219:
220:
221:
222:
223:
224:
225:
226:
227:
228:
229:
230:
231:
232:
233:
234:
235:
236:
237:
238:
239:
240:
241:
242:
243:
244:
245:
246:
247:
248:
249:
250:
251:
252:
253:
254:
255:
256:
257:
258:
259:
260:
261:
262:
263:
264:
265:
266:
267:
268:
269:
270:
271:
272:
273:
274:
275:
276:
277:
278:
279:
280:
281:
282:
283:
284:
285:
286:
287:
288:
289:
290:

Select allOpen in new window

 

by: itsmeandnobodyelsePosted on 2009-11-06 at 10:44:36ID: 25761821

valley,

if you made sure that a node has only leafs (and not a mix of sub branches and leafs) the

   node.children.size()

would give you the number of leafs.

 

by: valleytechPosted on 2009-11-06 at 11:05:08ID: 25762034

Sorry to confuse you. More acurate to state number of keys at  each level . For example
 +: 1 -->  one key at this level one
 ++ : 3--> three keys at level two
 +++: 10  -> ten keys at level three

 

by: itsmeandnobodyelsePosted on 2009-11-06 at 11:14:24ID: 25762140

>>>> More acurate to state number of keys at  each level .

Ok. When traversing the tree you have to sum up children.size() for each level. You may use the 'ident' (+++)  to know which level it is. Best use a global vector<int> for the counters.

  vector<int> counters(100, 0);  // would provide 100 slots initialized with 0

 

by: Infinity08Posted on 2009-11-06 at 12:10:33ID: 25762615

If you link all nodes on the same level together, starting with the leftmost node on each level, you can easily count them.

 

by: valleytechPosted on 2009-11-06 at 12:41:58ID: 25762854

should I add an extra variable  in the node to indicate its level number?

 

by: valleytechPosted on 2009-11-06 at 14:09:24ID: 25763514

oh  i understand what you mean now. Let me figure out how to put in code.

 

by: valleytechPosted on 2009-11-06 at 21:24:45ID: 25765105

when i declare

    vector<int> counters(100,0);  // would provide 100 slots initialized with 0

in main(), it is ok. However, it has error when i declare it in Tree() class with this error message

D:\OPENGL\Cpp3b.cpp(25) : error C2059: syntax error : 'constant'

please advise. tks.

 

by: valleytechPosted on 2009-11-06 at 22:32:36ID: 25765207

i finish it by working around :) . However, I still need how to fix  this error because i don't know how to use constructor for vector. Thanks.

when i declare

    vector<int> counters(100,0);  // would provide 100 slots initialized with 0

in main(), it is ok. However, it has error when i declare it in Tree() class with this error message

D:\OPENGL\Cpp3b.cpp(25) : error C2059: syntax error : 'constant'

please advise. tks.

 

 

by: itsmeandnobodyelsePosted on 2009-11-07 at 00:45:24ID: 25765476

>>>> vector<int> counters(100,0);  

- If that doesn't compile you probably have forgotten to insert

#include <vector>
using namespace std;

to the include part of the source.

- Or the variable 'counters' was redefined, i. e. there is another counters somewhere.

- Or you defined counters as member in a class. Then initialize it like

Tree::Tree()
: counters(100, 0)    // that is called an initializer
{
    // put here your current code for the constructor
    ...
}

 

by: itsmeandnobodyelsePosted on 2009-11-07 at 00:48:01ID: 25765481

>>>> should I add an extra variable  in the node to indicate its level number?
>>>> oh  i understand what you mean now. Let me figure out how to put in code.

The 'indent' you pass to drawNode already is a level information. Don't think you need more.

 

by: valleytechPosted on 2009-11-07 at 09:56:49ID: 25767265

here is my code. It works :) by using an array counters[100]
=================
void Tree::drawNode ( TreeNode &parentNode, int indent)
{
    int i=0,j=0;
    indent ++;
   
    counters[indent] = counters[indent]++;


    for( j =0; j <indent; j++)
    {
        //cout<<"+";
        fout<<"+";
    }
    //cout<<"\""<<parentNode.key<<"\""<<"  "<<endl;
    fout<<"\""<<parentNode.key<<"\""<<"  "<<endl;

    if( parentNode.children.size()== 0)
    {
        return;
    }
    else
    {
        for(int i = 0; i <parentNode.children.size();i++)
        {
            drawNode(parentNode.children[i],indent);
        }
    }
}
 
 
void Tree::draw()
{
    int indent = 0;
    cout<<endl<<"start display tree"<<endl;

    fout.open("Treeoutput.txt", ios::out );

    drawNode(root,indent);


    //cout<<endl<<"Number of keys on each level"<<endl;
    fout<<endl<<"Number of keys on each level"<<endl;
    for(int i =1; counters[i] != 0;i++)
    {
         for( int j =0; j <i; j++)
         {
            //cout<<"+";
            fout<<"+";
         }
         //cout<<":"<<counters[i]<<endl;
         fout<<":"<<counters[i]<<endl;
    }
    fout.close();
}
 
=================
Let me change to use vector as you suggested.

 

by: valleytechPosted on 2009-11-07 at 10:11:15ID: 25767325

I implement this idea

you defined counters as member in a class. Then initialize it like

Tree::Tree()
: counters(100, 0)    // that is called an initializer
{
    // put here your current code for the constructor
    ...
}

and get this error message

D:\OPENGL\Cpp3b.cpp(47) : error C2614: 'Tree' : illegal member initialization: 'acounter' is not a base or member

Let me post my completed code

#include <stdio.h>
#include <string>
#include <vector>
#include <fstream>
 
#include <iostream>
using namespace std;
 
 
struct TreeNode
{
    std::string key;
    std::vector<TreeNode> children; 
   
};
 
class Tree
{
    // the one and only root node
    TreeNode root;
    ifstream fin; 
    ofstream fout; 
    int counters[100];
    vector<int> acounters;  // would provide 100 slots initialized with 0 
    
public:  
    Tree();  
    bool    ignoreStartTags();
    bool    parseXML();
    void    draw();
 
private:
    void    parseXMLNode(TreeNode &parentNode);
    string  readCurrentXmlTag();
    string  readCurrentXmlKey(string tag); 
    void    drawNode(TreeNode & parentNode, int indent);
    string & trim(std::string & s);
}; 
Tree::Tree()
:acounter(100,0)
{ 
    for(int i =0; i<100;i++)
    {
        counters[i]=0;
    }
}
 
 
string & Tree :: trim(std::string & s)
{
    int len = (int)s.size();
    while (len > 0 && isspace(s[--len]))
           s.resize(len);
    return s;
} 
string Tree:: readCurrentXmlKey(string tag)
{
    string key;
    char array[200];
    int counter = 0; 
    string str;
 
    if( tag == "branch" || tag == "leaf")
    {
        counter = 3;
    }
    else if(tag =="attribute") 
    {
        counter = 2;
    }
    else if( tag == "/leaf")
    {
        counter = 0;
    }
 
    if( !fin.eof())
    {
        for(int i = 0; i < counter; i ++)
        {
            fin.getline(array,200);
            str = array;
            //getline(fin, str); 
            if( str.empty())
            {
                cout<<"in break"<<endl;
                break;
            } 
            cout<<"XmlKey-> read line : "<<array<<endl;
 
            if( i == 0)
            {
                char * pch;
                char delims[]= "=\"" ;           //"<=\">"; //get " must use \" to distingusih between newline and " 
 
                pch = strtok(array,delims);
              //  printf("1st~~~~~%s\n",pch);
                while(pch != NULL)
                {
                    if( strcmp(pch,"latin_name") ==0 ) 
                    {
                        pch = strtok(NULL,delims);
                      //  printf("2nd~~~~~%s\n",pch);
                        pch = strtok(NULL,delims);
                      //  printf("3rd~~~~~%s\n",pch);  
 
                        key = pch;
                        //cout<<Value<<endl;
                        break;
                    }
                    pch = strtok(NULL,delims);
 
                }//end of  strtok while
            }// end of if counter == 0
        }//end of for
        cout<<"key is :"<<key<<endl;
 
    }// end of file    
    return key;
} 
bool Tree::ignoreStartTags()
{
    char array[1000]; 
    fin.open("Treeinput.txt",ios_base::in); 
    if (!fin) 
    {
        cout << "Fail to open file!!!."<< endl;
        return false;
    }
    else
    {
        // just ignore the first 8 lines
        for( int i = 0; i< 8; i++)
        {
            fin.getline(array,100);
        }
        return true;
    } 
} 
 
 
void Tree::drawNode ( TreeNode &parentNode, int indent)
{
    int i=0,j=0;
    indent ++;
    
    counters[indent] = counters[indent]++; 

    for( j =0; j <indent; j++)
    {
        //cout<<"+";
        fout<<"+";
    } 
    //cout<<"\""<<parentNode.key<<"\""<<"  "<<endl;
    fout<<"\""<<parentNode.key<<"\""<<"  "<<endl; 
    if( parentNode.children.size()== 0)
    {
        return;
    }
    else
    {
        for(int i = 0; i <parentNode.children.size();i++)
        {
            drawNode(parentNode.children[i],indent);
        }
    }
}
 
 
void Tree::draw()
{
    int indent = 0;
    cout<<endl<<"start display tree"<<endl; 
    fout.open("Treeoutput.txt", ios::out ); 
    drawNode(root,indent); 

    //cout<<endl<<"Number of keys on each level"<<endl;
    fout<<endl<<"Number of keys on each level"<<endl;
    for(int i =1; counters[i] != 0;i++)
    {
         for( int j =0; j <i; j++)
         {
            //cout<<"+";
            fout<<"+";
         }
         //cout<<":"<<counters[i]<<endl;
         fout<<":"<<counters[i]<<endl;
    }
    fout.close();
}
 
bool Tree::parseXML() 
{
    string tag;
   //here in that function we put the loop you now have at begin of parseXMLNode
   //in case of read errors or missin g tags it return false
    
    if( !ignoreStartTags()) return false; 
    tag = readCurrentXmlTag(); 
    // read root key
    string key = readCurrentXmlKey(tag); 
    if( key.empty()) return false;
    root.key =key; 
    // now the root node is complete like any other parent node...
    parseXMLNode(root);
    return true;
} 
string Tree::readCurrentXmlTag()
{
    string Tag;
    char array[100];
    string str;
    
    if( !fin.eof())
    {
        fin.getline(array,100);
         
        str = array; 
        trim(str); 
        if( str.empty() || str == "/tree" || str == "  ")
        {
            return Tag;
        } 
        cout<<endl<<"XmlTag-> read line : "<<array<<endl; 
        char tmp[100];
        strcpy(tmp,array);
 
        char * pch;
        char delims[]= "< >" ;          
 
        pch = strtok(array,delims);
        while(pch != NULL)
        {
            if( strcmp(pch,"branch")==0 || strcmp (pch,"/branch")== 0||
                strcmp(pch,"leaf")== 0 || strcmp (pch,"/leaf")== 0 || strcmp(pch,"attribute") == 0)
            {
                Tag = pch;   
                break;
            }
            pch = strtok(NULL,delims);
 
        }//end of  strtok while
        
        if(Tag =="/branch")
        {
          
          //  cout<<"--->Tag is /branch"<<endl;
        } 
        cout<<"before return, Tag : "<<Tag<<endl;
        return Tag;
    }
    else
    {
        fin.close();
        //exit(1);
        return Tag;
    }  
}
void Tree::parseXMLNode( TreeNode &parentNode)
{
   // cout<<"Beginning of parseXMLNode"<<endl;
    string tag;
    string key;
    TreeNode child; 
    while(  (tag = readCurrentXmlTag()) != "/branch")
    {
        if(tag.empty() || tag == "/tree")
        {
            return;
        } 
        cout<<"**tag is : "<<tag<<endl;  
        key = readCurrentXmlKey(tag);
   
        if( key.empty())
        {
            cout << "empty key after readCurrentXmlKey(" << tag << ") " << endl;
            return;
        }
        
        child.key = key;
        parentNode.children.push_back(child);
        
        if(tag == "branch")
        {
            TreeNode &childRef = parentNode.children.back(); 
            //draw();
            cout<<"childRef key is "<<childRef.key<<endl;
            parseXMLNode(childRef);
        }
        else if( tag =="leaf")
        {
            //draw();
            tag == readCurrentXmlTag();
            if(tag == "/leaf")
            {
                continue;
            }
            else
            {
               // cout<<"****tag is :"<<tag<<endl;
               // cout<<"Missing /leaf tag"<<endl;
            }
        }
    }
    cout<<"current parent is : "<<parentNode.key<<endl<<endl;
    return;
}
 
int main()
{
    
    Tree tree;
    tree.parseXML();
    tree.draw(); 
    
    return 1;
}

                                              
1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
21:
22:
23:
24:
25:
26:
27:
28:
29:
30:
31:
32:
33:
34:
35:
36:
37:
38:
39:
40:
41:
42:
43:
44:
45:
46:
47:
48:
49:
50:
51:
52:
53:
54:
55:
56:
57:
58:
59:
60:
61:
62:
63:
64:
65:
66:
67:
68:
69:
70:
71:
72:
73:
74:
75:
76:
77:
78:
79:
80:
81:
82:
83:
84:
85:
86:
87:
88:
89:
90:
91:
92:
93:
94:
95:
96:
97:
98:
99:
100:
101:
102:
103:
104:
105:
106:
107:
108:
109:
110:
111:
112:
113:
114:
115:
116:
117:
118:
119:
120:
121:
122:
123:
124:
125:
126:
127:
128:
129:
130:
131:
132:
133:
134:
135:
136:
137:
138:
139:
140:
141:
142:
143:
144:
145:
146:
147:
148:
149:
150:
151:
152:
153:
154:
155:
156:
157:
158:
159:
160:
161:
162:
163:
164:
165:
166:
167:
168:
169:
170:
171:
172:
173:
174:
175:
176:
177:
178:
179:
180:
181:
182:
183:
184:
185:
186:
187:
188:
189:
190:
191:
192:
193:
194:
195:
196:
197:
198:
199:
200:
201:
202:
203:
204:
205:
206:
207:
208:
209:
210:
211:
212:
213:
214:
215:
216:
217:
218:
219:
220:
221:
222:
223:
224:
225:
226:
227:
228:
229:
230:
231:
232:
233:
234:
235:
236:
237:
238:
239:
240:
241:
242:
243:
244:
245:
246:
247:
248:
249:
250:
251:
252:
253:
254:
255:
256:
257:
258:
259:
260:
261:
262:
263:
264:
265:
266:
267:
268:
269:
270:
271:
272:
273:
274:
275:
276:
277:
278:
279:
280:
281:
282:
283:
284:
285:
286:
287:
288:
289:
290:
291:
292:
293:
294:
295:
296:
297:
298:
299:
300:
301:
302:
303:
304:
305:
306:
307:
308:
309:
310:
311:
312:
313:
314:
315:
316:
317:
318:
319:
320:
321:
322:
323:
324:
325:
326:
327:
328:
329:
330:
331:
332:
333:

Select allOpen in new window

 

by: itsmeandnobodyelsePosted on 2009-11-08 at 01:52:25ID: 25769959

>>>> error C2614: 'Tree' : illegal member initialization: 'acounter' is not a base or member

Yes, as I told you would need to define the acounter a member of the Tree class:

class Tree
{
     // in the header use the std:: prefix and no 'using namespace std;'
     // That way you won't get name conflicts
     std::vector<int> acounter;  
     // put here the rest
     ....

};


>>>>  vector<int> counters(100,0);  // would provide 100 slots initialized with 0
>>>>  in main(), it is ok. However, it has error when i declare it in Tree() class with this error
>>>> D:\OPENGL\Cpp3b.cpp(25) : error C2059: syntax error : 'constant'

class Tree
{
     std::vector<int> counters;  // you can't give a size here but only in the initializer
                                                 // of teh constructor(s)
     // here the rest
     ....

};


// tree.cpp
 

Tree::Tree()
    : counters(100, 0)            // here the size can given
{
      ...
}




>>>> It works :) by using an array counters[100]

Probably you defined a global array in the cpp ?

Note, you better make all global variables members of the Tree class. That allows two handle two or more trees with your code (what actually is a precondition for OOP - object oriented programming).


 

by: valleytechPosted on 2009-11-09 at 07:46:26ID: 25776895

no. I declare it on the Tree class

 

by: itsmeandnobodyelsePosted on 2009-11-09 at 08:41:46ID: 25777515

>>>> no. I declare it on the Tree class
Yes, but the dimension must be defined in the initializer list of the Tree constructor.

20120131-EE-VQP-002

3 Ways to Join

30-Day Free Trial

The Experts

98% positive feedback on 31,087 answers since March 2000. angeliii is a Microsoft Most Valuable Professional for his work with MS SQL Server & Develoment.

He has also proven his knowledge of Visual Basic Programming, PHP Scripting and Oracle Databases.

The Experts

97% positive feedback on 10,752 answers since July 2000. lrmoore has more than 18 years experience in the networking industry.

The six-time Mircosoft MVPs specialties include firewalls, virtual private networking, and network management.

Testimonials

"...and excellent source for support... Kind of like having your very own IT dept." Electriciansnet

Testimonials

"I was apprehensive at signing up at first. However... it has already made my life as an IT administrator much easier." JaCrews

Testimonials

"WOW! You guys have great, active, and knowledgeable people on here." moore50

Business Clients

Business Clients

In the Press

"If you’ve got a question... Experts Exchange can supply an answer.”

In the Press

"...an invaluable aid for both IT professionals and those who require tech support."

In the Press

"where IT professionals provide quick answers on just about any topic"

Business Account Plans

Loading Advertisement...