//打印二叉树第K层的所有结点
//根结点为第0层
void printNodeOfKthLevel(BinaryTree* pRoot,int k)
{
if(pRoot==NULL || k<0)
return ;
if(k==0)
cout<<pRoot->value<<" ";
printNodeOfKthLevel(pRoot->left,k-1);
printNodeOfKthLevel(pRoot->right,k-1);
}
//打印二叉树第K层的所有结点
//根结点为第0层
void printNodeOfKthLevel(BinaryTree* pRoot,int k)
{
if(pRoot==NULL || k<0)
return ;
if(k==0)
cout<<pRoot->value<<" ";
printNodeOfKthLevel(pRoot->left,k-1);
printNodeOfKthLevel(pRoot->right,k-1);
}