CareerCup

struct treenode
{
struct treenode *left;
struct treenode *right;
int data;
};

struct treenode *head; //Initialized elsewhere

void printlevel(struct treenode *node, int curlevel, int level)
{
if(curlevel == level)
{
printf("%d\n", node->data);
}
else
{
printlevel(node->left, curlevel+1, level);
printlevel(node->right,curlevel+1,level);
}
}

//Call function as
printlevel(head,0,requiredlevel);

This is just standard BFS, and you don't need recursion but a queue

made it simpler

struct treenode 
{
    struct treenode *left;
    struct treenode *right;
    int data;
};

struct treenode *head; //Initialized elsewhere

void printlevel(struct treenode *node, int level)
{
    if(node == NULL)
        return

      if(level == 0)
          cout << node->data;
      else { 
          printlevel(node->left, level-1);
          printlevel(node->right, level-1);
      }
}

//Call function as
printlevel(head, requiredlevel);

/*funtion to print all the nodes of a tree at a given level */

print_at_level ( TREE* node, int lvl, int level ) {


        if(node == NULL)
                return;
        if(level == lvl )
                printf("%d ",node->value);
        print_at_level(node->right,lvl+1,level);
        print_at_level(node->left,lvl+1,level);

}

Cisco gives hike once in 2-3 years.

New-Joinees only get hike after 2-3 years, so take 100% hike at the time of joining .. . otherwise don't cry after joining. :)

@wyefei88: first go through the problem....thn go thru the tree....u need to understand the diff. b/w bst nd a normal binary tree...lolz