	[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.

07/03/2009 at 08:33AM PDT, ID: 24542559

	[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!

8.0

C++ General Tree

Asked by didijc in Microsoft Visual C++.Net, Microsoft Visual C++, C++ Programming Language

Tags: Visual C++ 2008

Hey C++ guru's...

I'm pretty new to the C++ world and would really appreciate some help... ...

I'm trying to build a general tree (a tree with one root and N children), I've written the code and compiled it quote/un-quote successfully... ...I say that because I am faced with a runtime error that basically stops my efforts dead in its tracks...

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:

           
           
             /////// ********* GeneralTree.h *********///////
///////-------------------------------------///////
#ifndef GENERALTREE_h
#define GENERALTREE_h
 
#include <iostream>
 
using namespace std;
 
class GeneralTree{
	public:
		struct GenTreeNode{
			int int_transactionID, int_totalNumChildren;
			GenTreeNode *ptr_nextChild;
		};
		
		//initialize root
		GenTreeNode *root;
 
		GeneralTree(){
			int int_totalNumChildren = 0;
		}
 
		~GeneralTree(){
			clear();
		}
 
		void clear(){
			//point to the node to be deleted
			GenTreeNode *tmp;
			//used to visit each node in the tree. 
                        //We start with the first actual node off of "root"
			GenTreeNode *traverse = root->ptr_nextChild;
			
			//while the tree is not empty
			while(traverse != NULL){
				//store the current node
				tmp = traverse;
				//visit the next node
				traverse = traverse->ptr_nextChild;
				//free the memory taken up by the current node
				delete tmp;
			}
		}
 
		void addChildren(int *tranID, int cNo){
			int int_totalNumChildren = cNo;
			GenTreeNode *genTree = new GenTreeNode[int_totalNumChildren];
 
			for(int i=0; i<int_totalNumChildren; i++){
				genTree->int_transactionID = tranID[i];
			}
		}
 
		void PrintTree(GenTreeNode *tree) {
			/* .: Print all the items in the tree to which root points...the item in the root is printed first, followed by its children :: as long as the root is not empty :. */
			if (tree != NULL){
				cout << tree->int_transactionID << " ::- " << tree->int_totalNumChildren << endl;
				// Print children
				PrintTree(tree->ptr_nextChild);
			}
		}
 
		void deleteChild(GenTreeNode *ChildPtr){
		}
};
 
#endif
 
/////// ********* Main.cpp *********///////
///////-------------------------------///////
#include <iostream>
#include <fstream>
#include "GeneralTree.h"
 
using namespace std;
 
int main(){
	GeneralTree *gTree = new GeneralTree;
	int tID = 100; 
	int numOfChildren = 10;
 
	cfisTree->addChildren(&tID, numOfChildren);
	cfisTree->PrintTree(gTree->root);
 
	return 0;
}

           
         

20091028-EE-VQP-87 - Hierarchy / EE_QW_3_20080625

1. jkr 603,894
2. Infinity08 418,105
3. evilrix 362,809
4. itsmeandn... 338,415
5. mrjoltcola 128,938
6. Zoppo 68,660
7. pgnatyuk 66,463
8. alb66 59,430
9. DanRollins 44,961
10. AndyAins... 44,952
11. ozo 40,128
12. Let_Me_Be 40,056
13. Gideon7 37,720
14. trinitrotolu... 34,422
15. jaime_oliv... 33,980
16. pepr 30,316
17. sunnycoder 20,168
18. ikework 19,585
19. masheik 18,698
20. LordOfPo... 18,490
21. JohnGaby 18,296
22. johnnash... 17,769
23. josgood 17,000
24. abel 16,556
25. Gurudenis 16,260

1. jkr 7,879,985
2. itsmeandn... 2,348,823
3. Infinity08 1,945,516
4. Axter 1,467,234
5. evilrix 1,017,747
6. nietod 859,677
7. AlexFM 732,762
8. DanRollins 728,138
9. jaime_oliv... 722,883
10. rstaveley 524,876
11. grg99 392,524
12. efn 329,300
13. chensu 313,112
14. AlexViroc... 263,393
15. Zoppo 254,853
16. Salte 247,544
17. wayside 215,557
18. ikework 215,379
19. jhance 207,462
20. rajeev_d... 207,388
21. ambience 183,231
22. sunnycoder 180,898
23. AndyAins... 179,572
24. bcladd 171,128
25. SteH 170,387

C++ General Tree

Asked by didijc in Microsoft Visual C++.Net, Microsoft Visual C++, C++ Programming Language

Tags: Visual C++ 2008

About this solution