	[x] Posted via EE Mobile
	Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again.

10/13/2009 at 01:24PM PDT, ID: 24809171

	[x] Attachment Details

[x]

The Solution Rating System

With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.

The Grade of the Solution
The Zone Rank of the Expert Providing the Solution
The Number of Author and Expert Comments
The Number of Experts Contributing
The Feedback of the Community

Your Input Matters
Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.

If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support.

Thank you!

5.4

insert

Asked by valleytech in C++ Programming Language

at first, i try to do insert the first node when the root is NULL. When i run debugger, it makes sense. However, i see has bugs when it meet the line
cout<<"current node key is "<<ptr->key

and what is didfernt between that line and
//printf(" current node key is %s",ptr->key);
because it seems they are same to me:)

View the Solution FREE for 30 Days

         
           
             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:

           
           
             #include <stdio.h>
#include <string>
#include <vector>
 
#include <iostream>
using namespace std;
 
using std::string;
using std::vector;
 
struct TreeNode
{
    string key;
    vector<TreeNode > childs;	
};
 
class Tree
{
    TreeNode *root;
 
    string tag;
 
    public:
        Tree();
        void parseXmlNode(Tree aTree);
        TreeNode * insert(TreeNode aNode)  ;
       
       
};
 
Tree::Tree()
{
    root = NULL;
    
}
 
TreeNode* Tree::insert(TreeNode aNode)
{
    TreeNode *ptr= root;
 
    if (ptr == NULL)
    {
        ptr = &aNode;
        return ptr;
    }
    else
    {
        while(ptr->childs.size() >0)
        {
            ptr = & ptr->childs[ptr->childs.size()];
        }
 
        ptr->childs.push_back(aNode);
        
    }
     return ptr;
   
}
 
/*
void Tree::insertRoot(const string & rootkey, const vector<string> & children)
{
    root.key = rootkey;
 
    TreeNode child;
 
    for (int i = 0; i < children.size(); ++i)
    {
        child.key = children[i];
        root.childs.push_back(child);
    }
}
*/
 
void Tree:: parseXmlNode(Tree aTree)
{
    /*
    // branch or leaf?
    // read "<branch>" or "<leaf>" from file
    tag = readXmlTag();
    cout<<tag;
 
    // read the actual data of this node from file
    TreeNode nodeRaw = readXmlNodeData();
    */
 
    string Tag;
    string Value;
 
    char *filename ="Treeinput.txt";
    char array[150];
    
    bool branchFound = false;
    bool leafFound   = false;
    int counter = 0;
 
    FILE * fp;
 
    TreeNode nodeRaw, *node;
 
    fp = fopen(filename, "r");
    if( fp == NULL)
    {
        printf("Fail to open file\n");
        exit(1);
    }
    else
    {
        while( !feof(fp))
        {
            //reset after every four lines
            if( counter == 4) 
            {
                counter = 0;
            }
 
            fgets(array,sizeof(array),fp);             // include newline character
      
            array[strlen(array) -1] = '\0';            // trim off newline character
      //    printf("array is %slength is %d\n",array, strlen(array)); // strlen includes newline too
            
            char * pch;
            char delims[]= "<=\">"; //get " must use \" to distingusih between newline and " 
 
            pch = strtok(array,delims);
            while(pch != NULL)
            {
                if( strcmp(pch,"branch")==0)
                {
                    Tag = pch;
                    //printf("+++++%s\n",pch);
                    //cout<<Tag<<endl;
 
                    branchFound = true;
 
                    break;
                }
 
                if( strcmp(pch,"latin_name") ==0 ) 
                {
                    //printf("1st~~~~~%s\n",pch);
                    pch = strtok(NULL,delims);
                    //printf("2nd~~~~~%s\n",pch);
                    pch = strtok(NULL,delims);
                    //printf("3rd~~~~~%s\n",pch);  
                    
                    Value = pch;
                    //cout<<Value<<endl;
                    break;
                }
                if( strcmp(pch,"leaf")==0)
                {
                    Tag = pch;
                    //printf("*****%s\n",pch);
                    //cout<<Tag<<endl;
 
                    leafFound = true;
 
                    break;
                }
                pch = strtok(NULL,delims);
 
            }//end of  strtok while
 
           // string TagnValue = Tag +" "+ Value; 
           // cout<<TagnValue;
 
            if( counter <2 && branchFound == true && Value.size() >0)
            {
                cout<<Tag<<" "<<Value<<endl;
                branchFound = false;
    
                nodeRaw.key = Value; // store Branch Value to nodeRaw
                Value ="\0";
 
                //insertion  here
 
                cout<<"nodeRaw key is "<<nodeRaw.key;
 
                TreeNode * ptr = aTree.insert( nodeRaw);
                
                //printf(" current node key is %s",ptr->key);
                cout<<"current node key is "<<ptr->key;
            
            }
            if( counter <2 && leafFound == true && Value.size() >0)
            {
                cout<<Tag<<" "<<Value<<endl;
                leafFound = false;
 
                nodeRaw.key = Value; // store Leaf Value to nodeRaw
 
                Value ="\0";
                
                //insertion  here
            
            
            }
            counter ++; 
        }//end of feof while
    }// end of else ( successfully open file)
 
    
      // insert the new node under the current parent-node
    // and return a reference to just added node
   // TreeNode &node = insertNode(parent, nodeRaw);
 
    /*
    // we're finished with this node, so go to next node in xml-file
    // recusive call of parseXmlNode
    if(tag == branch) 
    {
        // for a branch, the parent-node is the node we just added
        parseXmlNode(node);
    }
    else
    {
        // for a leaf, the parent-node is the last added parent-node
        parseXmlNode(parent);
    }
 
    */
}
 
 
 
 
 
/*
void Tree::set_root (TreeNode aNode)
{
    root = aNode;
}
 
*/
 
void main(void)
{
    Tree aTree;
    
    aTree.parseXmlNode( aTree);
 
}

           
         

20091111-EE-VQP-91 - Hierarchy / EE_QW_3_20080625

1. jkr621,554
2. Infinity08428,105
3. evilrix386,063
4. itsmeandn...345,939
5. mrjoltcola136,370
6. pgnatyuk80,095
7. Zoppo69,160
8. alb6660,430
9. AndyAins...48,452
10. trinitrotolu...48,102
11. DanRollins45,961
12. Let_Me_Be43,756
13. ozo40,128
14. Gideon737,720
15. jaime_oliv...36,480
16. pepr30,816
17. ikework23,327
18. sunnycoder20,168
19. masheik18,698
20. LordOfPo...18,490
21. JohnGaby18,296
22. johnnash...17,769
23. josgood17,000
24. abel16,556
25. Gurudenis16,260

1. jkr7,897,645
2. itsmeandn...2,356,347
3. Infinity081,955,516
4. Axter1,467,234
5. evilrix1,041,001
6. nietod859,677
7. AlexFM732,762
8. DanRollins729,138
9. jaime_oliv...725,383
10. rstaveley524,876
11. grg99392,524
12. efn329,300
13. chensu313,112
14. AlexViroc...263,393
15. Zoppo255,353
16. Salte247,544
17. ikework219,121
18. wayside215,557
19. jhance207,462
20. rajeev_d...207,388
21. ambience183,231
22. AndyAins...183,072
23. sunnycoder180,898
24. bcladd171,128
25. SteH170,387

insert

Asked by valleytech in C++ Programming Language

About this solution