inorder traversal of binary tree
Given a binary tree,print its inorder traversal without using recursion and stack.
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
it can be done using threaded tree taking extra pointer rthread pointing to the inorder successor of each node...
ReplyDelete@kamakshi can you please elaborate your approach...:)
ReplyDelete