int sumAtKthLevel(node*root, int k){
	int sum=0;
	if(root == NULL){
		return 0;
	}
	if(k==1){
		sum+=root->data;
		return sum;
	}
	sumAtKthLevel(root->left,k-1);
	sumAtKthLevel(root->right,k-1);
}