mirror of a binary tree
Write a function in c to find the mirror image of a binary tree.Your method should be optimized in memory and time complexity.
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
reverse(struct node *root)
ReplyDelete{
if(root->right==NULL && root->left==NULL)
return 0;
else
{
swap(root->left,root->right);
reverse(root->left);
reverse(root->right);
}
}
@kamakshi correct..
ReplyDelete