int total(struct node* root){ if(root){ if(!root->left && !root->right) return 1; return (total(root->left)+total(root->right));} } can be done like this too. But I really like your videos Sir.Keep uploading :)
A Gnutella topology looks like a balanced ternary tree with 4 levels of nodes, i.e., peers, as shown in the picture below. Thus, there is 1 root at Level 1, which has 3 children at Level 2, which each have 3 children at Level 3, which in turn each have 3 children at Level 4 - thus, there are a total of 40 nodes. If the root node (Level 1) sends a Query message with TTL=2, then what are the number of nodes receiving the Query message, not including the originating node? Enter your answer as a numeric value in the text box below.
can you assist me with this method void IncrementLeaves( int value ) - Function: adds value to all the leaves’ info. - Precondition: Tree has been initialized. - Postcondition: Function value = leaves’ info is increased by value.
Global parameter is a bad idea, since you leak information out of the method. We could parametrise count (root, count) and initialise as count (root_of_tree, 0).
int ans=0; int count(struct Node *root) { if(root==NULL) return 0; if(root->left) count(root->left); if(root->right) count(root->right); if(root->left && root->right) ans++; } Is this fine @vivekanand sir.
