std::ostringstream str;
std::ostringstream str2;
rbtree.dumpTree(str);
- str2 << "tree has 14 node(s)\n" <<
- "b. (black) [subtreeroot]\n" <<
- " a. (black)\n" <<
- " NULL\n" <<
- " NULL\n" <<
- " d.e.f. (black) [invisible]\n" <<
- " begin down from d.e.f.\n" <<
- " w.y. (black) [invisible] [subtreeroot]\n" <<
- " begin down from w.y.\n" <<
- " p. (black) [subtreeroot]\n" <<
- " o. (red)\n" <<
- " NULL\n" <<
- " NULL\n" <<
- " q. (red)\n" <<
- " NULL\n" <<
- " NULL\n" <<
- " end down from w.y.\n" <<
- " x. (red)\n" <<
- " NULL\n" <<
- " NULL\n" <<
- " z. (red)\n" <<
- " begin down from z.\n" <<
- " j. (black) [subtreeroot]\n" <<
- " NULL\n" <<
- " NULL\n" <<
- " end down from z.\n" <<
- " NULL\n" <<
- " NULL\n" <<
- " end down from d.e.f.\n" <<
- " c. (red)\n" <<
- " NULL\n" <<
- " NULL\n" <<
- " g.h. (red)\n" <<
- " begin down from g.h.\n" <<
- " i. (black) [subtreeroot]\n" <<
- " NULL\n" <<
- " k. (red)\n" <<
- " NULL\n" <<
- " NULL\n" <<
- " end down from g.h.\n" <<
- " NULL\n" <<
+ str2 << "tree has 14 node(s)\n"
+ "b. (black) [subtreeroot]\n"
+ " a. (black)\n"
+ " NULL\n"
+ " NULL\n"
+ " d.e.f. (black) [invisible]\n"
+ " begin down from d.e.f.\n"
+ " w.y. (black) [invisible] [subtreeroot]\n"
+ " begin down from w.y.\n"
+ " p. (black) [subtreeroot]\n"
+ " o. (red)\n"
+ " NULL\n"
+ " NULL\n"
+ " q. (red)\n"
+ " NULL\n"
+ " NULL\n"
+ " end down from w.y.\n"
+ " x. (red)\n"
+ " NULL\n"
+ " NULL\n"
+ " z. (red)\n"
+ " begin down from z.\n"
+ " j. (black) [subtreeroot]\n"
+ " NULL\n"
+ " NULL\n"
+ " end down from z.\n"
+ " NULL\n"
+ " NULL\n"
+ " end down from d.e.f.\n"
+ " c. (red)\n"
+ " NULL\n"
+ " NULL\n"
+ " g.h. (red)\n"
+ " begin down from g.h.\n"
+ " i. (black) [subtreeroot]\n"
+ " NULL\n"
+ " k. (red)\n"
+ " NULL\n"
+ " NULL\n"
+ " end down from g.h.\n"
+ " NULL\n"
" NULL\n";
EXPECT_EQ(str2.str(), str.str());
}