Confirmed that my print is superior, but found a print bug that's not yet solved

source1.h

@@ -19,7 +19,7 @@ class Triehard // compressed binary trie
 				Trienode * left;
 				Trienode * right;
 				
-				/*
+				
 				//Convenient method for printing.
 				//Returns a string to be able to chain
 				//printing more easily.
@@ -27,15 +27,15 @@ class Triehard // compressed binary trie
 				string getNodeVal(int side)
 				{
 					string output = "";
-					
+					string sideStr = to_string(side);
 					for(int i = 0; i < magnitude; ++i)
 					{
-						output += to_string(side);
+						output += sideStr;
 					}
 					
 					return output;
 				}
-				*/
+				
 				
 			public:
 			
@@ -62,7 +62,7 @@ class Triehard // compressed binary trie
 					return flag;
 				}
 				
-				/*
+				
 				//Side is 0 (left) or 1 (right)
 				void print(int side, string output = "")
 				{
@@ -80,7 +80,7 @@ class Triehard // compressed binary trie
 					{
 						right->print(1, output + val);
 					}
-				}*/
+				}
 				
 				Trienode * getLeft()
 				{
@@ -152,7 +152,7 @@ class Triehard // compressed binary trie
 			delete right;
 		}
 		
-		/*
+		
 		void print()
 		{
 			//Default param arg seems to be a bit different
@@ -160,7 +160,7 @@ class Triehard // compressed binary trie
 			//function, try to fix later perhaps?
 			if(left != nullptr)left->print(0);
 			if(right != nullptr)right->print(1);
-		} */
+		} 
 		
 		// build an array of what is "processed" so far. then when a flag is hit, print that array. 
 		void mainPrint(Trienode * curnode, vector<int> * chars, int right)
@@ -684,4 +684,4 @@ class Triehard // compressed binary trie
 		}
 };
 
-#endif
+#endif

source2.h

@@ -643,4 +643,4 @@ class Triehard2 // compressed binary trie
 		}
 };
 
-#endif
+#endif

test.cc

@@ -6,17 +6,22 @@ int main()
 {
 	Triehard * test = new Triehard();
 	cout << "success! Created test" << endl;
-	int x[3] = {0,1,0};
-	int y[5] = {1,0,1,1,0};
+	int x[3] = {0,0,0};
+	int y[5] = {1,0,0,1,0};
+	int z[6] = {0,0,0,0,0,1};
 	test->insert(x, 3);
 	cout << "success! inserted x" << endl;
 	test->insert(y, 5);
 	cout << "success! inserted y" << endl;
+	test->insert(z,6);
+	cout << "success! inserted z" << endl;
+	//test->print();
 	test->myPrintIsBetterThanYoursLogan();
 	cout << "Print Done!" << endl;
 	test->cut(x, 3);
 	cout << "success! cut tree" << endl;
-	test->myPrintIsBetterThanYoursLogan();
+	test->print();
+	//test->myPrintIsBetterThanYoursLogan();
 	delete test;
 	cout << "success! Completed test" << endl;
 	//while(1);