int doo(node*root){ if(root !=0 ) { if(root->left==0 && root->right==0) return root->data; int L=doo(root->left); int R=doo(root->right); if(L>R) return R; else return L;} } this code used for a. find the sum of leaves items in a binary tree b. find the minimum item in a binary tree c. find the minimum item in the leaves of a binary tree d. the maximum item in the leaves of a binary tree

int doo(node*root){ if(root !=0 ) { if(root->left==0 && root->right==0) return root->data; int L=doo(root->left); int R=doo(root->right); if(L>R) return R; else return L;} } this code used for a. find...

int doo(node*root){

if(root !=0 ) {

if(root->left==0 && root->right==0) return root->data;

int L=doo(root->left);

int R=doo(root->right);

if(L>R) return R; else return L;}

}

this code used for

find the sum of leaves items in a binary tree

find the minimum item in a binary tree

find the minimum item in the leaves of a binary tree

the maximum item in the leaves of a binary tree

Jun 08, 2022