C++ (Cpp) TraverseInOrder示例

示例#1

文件： traverse_in_order.cpp 项目： skhal/algo

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);
}

示例#2

文件： 4.29.c 项目： unice2345/dsaa

int main()
{
	SearchTree T = NULL;

	T = MakeRandomTree( T, 0, 10 );

	Traverse( T );
	printf("\n");

	TraverseInOrder( T );
	printf("\n");

}