CareerCup

void printAllPath (node* root, int* pPath, int index)
{
	int i;
	if((root->lChild == 0) && (root->lChild == 0))
	{
		pPath[index]=root->data;
		for(i=0;i<=index;i++)
		{
			printf("[%d]",pPath[i]);
		}
		printf("\n");
	}
	else
	{
		pPath[index]=root->data;
		if(root->lChild)
		{
			printAllPath(root->lChild,pPath,index+1);
		}
		if(root->rChild)
		{
			printAllPath(root->rChild,pPath,index+1);
		}
	}
}

I think you need to correct this.
if((root->lChild == 0) && (root->lChild == 0))

The above code works, no problem with the code. Only one change, the if condition when he is printing the path should be lchild && rchild.

Here is a working function code that prints all paths from root to the leaves :
Note I have created a dummy main() to test the function.

#include<iostream>	/* Generic Headers */
using namespace std;

typedef unsigned int Uint;
struct node{
string val;
node* leftChild;
node* rightChild;
} *root, *A,*B,*C,*D,*E,*F,*G;

void printPath(node *p,string path)
{
    if(p->leftChild==NULL&&p->rightChild==NULL)
        { cout<<(path+"->"+p->val)<<endl; return; }
    if(p->leftChild!=NULL)
        printPath(p->leftChild,(path+"->"+p->val));
    if(p->rightChild!=NULL)
        printPath(p->rightChild,(path+"->"+p->val));
}

int main()
{
    A = new node; A->val = "A";
    B = new node; B->val = "B";
    C = new node; C->val = "C";
    D = new node; D->val = "D";
    E = new node; E->val = "E";
    F = new node; F->val = "F";
    G = new node; G->val = "G";
    A->leftChild = B; A->rightChild = D;
    B->leftChild = NULL; B->rightChild = C;
    C->leftChild = NULL; C->rightChild = NULL;
    D->leftChild = E; D->rightChild = F;
    E->leftChild = NULL; E->rightChild = G;
    F->leftChild = NULL; F->rightChild = NULL;
    G->leftChild = NULL; G->rightChild = NULL;
    root = A;
    printPath(root,"Start");
}

Working tested code....

int printpath(tree *root)
{
    static int count;
    int i;
    if(!root)
    {
        return 0;
    }
    if(root->left == NULL && root->right==NULL)
    {
        a[count++]= root->data;
        for(i=0;i<count;i++)
            printf("__%d__",a[i]);
        printf("\n");
        return 0;
    }
    a[count++]= root->data;
    if(root->left!=NULL)
    {
        printpath(root->left);
        count--;
    }
    if(root->right!=NULL)
    {
        printpath(root->right);
        count--;
    }
    return 0;
}

{
#include "iostream"
using namespace std;
struct node
{
node* left;
node* right;
string val;

node(string data )
{
val=data;
left=NULL;
right=NULL;
}
};


void printPaths(node* nd, string path)
{
if(nd==NULL)
return;

if(path.empty())
path = nd->val;
else
path+= nd->val;

if(nd->left==NULL && nd->right==NULL)
{
unsigned int i = 0;
while(i<path.size())
{
cout << path[i];
i+=1;
}
cout << endl;
return;
}
printPaths(nd->left,path);
printPaths(nd->right,path);
}

int main()
{
node* root = new node("A");
root->left=new node("B");
root->right=new node("C");
root->left->left=new node("D");
root->left->right=new node("K");
root->right->left=new node("Z");
root->right->right=new node("E");

printPaths(root,"");
}
}