TVisits TraverseInOrder(TNodePtr node) { TVisits visits; if (node) { if (node->Left) { visits += TraverseInOrder(node->Left); } visits.push_back(*node); if (node->Right) { visits += TraverseInOrder(node->Right); } } return std::move(visits); }
int main() { SearchTree T = NULL; T = MakeRandomTree( T, 0, 10 ); Traverse( T ); printf("\n"); TraverseInOrder( T ); printf("\n"); }