rank of node
Propose a tree based data structure to identify a node with nth rank with maximum efficiency .
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
use a red-black tree with size of subtree as another element in the structure of each node.
ReplyDeletesize(node) = size(node->left)+sizeof(node->right)+1;
for each node rank = size(node->left)+1;