C++ (Cpp) levelordertraversal Examples

Example #1

File: TreesUsingLinkedList.c Project: NamanArora/Cpp-Algorithms

int main()
{
    int in;
    int num;
    do
    {
        system("cls");
        printf("1.Insert element\n2.Search element\n3.Level order traversal\n");
        scanf("%d",&in);
        switch(in)
        {
            case 1: create(); break;
            case 2: 
            printf("Enter num to be searched: ");
            scanf("%d",&num);
            if(search(num,root))
                printf("Found");
            else
                printf("Not found");
            getch();
            break;
            case 3:
            levelordertraversal();
            getch();
            break;
        }
    }while(in!=-1);
    return 0;
}

Example #2

File: TreesUsingLL.c Project: nitinprakash96/Data-structures

int main()
{
    int in;
    int num;
    do
    {
        system("cls");
        printf("1.Insert element\n2.Level order traversal\n");
        scanf("%d",&in);
        switch(in)
        {
            case 1: create(); break;
            case 2:
            levelordertraversal();
            getch();
            break;
        }
    }while(in!=-1);
    return 0;
}