Professional Documents
Culture Documents
Dap An
Dap An
}
B.
int
SUMTNode1conOfLevelK(TNode
*root, int k)
{
int KQ=0;
if(!root)
return 0;
if(k == 0 && ((!root->Left
&&root->Right) || (root-
>Left&&!root->Right))) //đến
mức cần tìm
KQ+=root->info;
k--; //Mức k giảm dần về 0
KQ+=sumTNode1conOfLevelK(root
->Left, k); //đệ quy trái
KQ+=sumTNode1conOfLevelK(root
->Right, k);//đệ quy phải
return KQ;
}
c.
void DeleteNode(TNode* &root)
{
if(root)
{
DeleteNode(root->Left);
DeleteNode(root->Right);
if(root->Info%2!=0
&&root->info%3==0)
Delete (root,root-
>Info);
}
}
CẪU 4:
CÂU 5:
a
b.
xoa 5
Xóa 35: