CareerCup

sorry it is binary tree

For a straight binary tree do any traversal of the tree, printing each node value if it's in range.

yeah one can easily do and preorder traversal adn get all the nodes printed;
preorder(root)
{
if(leftchild!=null)
{
preorder(leftchild);
}
if(leftchild!=null)
{
preorder(rightchild);
}
}

preorder(root)
{
print(root.element);
if(leftchild!=null)
{
preorder(leftchild);
}
if(leftchild!=null)
{
preorder(rightchild);
}
}

of course you can print the node whose value is between the max and min when you execute a inorder traverse, however, using recusive may be a better solution

void Print( node* T , int max , int min )
{
     if( T==NULL )
      return;
      
     if( T->info > max )
      {
         Print( T->left , max , min );
         
         return;
         
         }
         
      else if ( T->info < min ) 
       {
          Print( T->right , max , min );
          
          return;
          
          }
          
       else
        {
        print( T->info );
        
         Print( T->left , max , min );
          Print( T->right , max , min );
        
        
        return;
        
        }
        
        
        }

Run the binary search on the given tree. If the current node is greater than both the values take the left branch. In case root is less than both value take the right branch. Once its in between, only then run the inorder traversal from that root.