you have to store the result some where for that you don't have
inbuilt datatype like python those will take care of your overflow
On Mon, May 3, 2010 at 9:46 AM, siddharth srivastava
akssps...@gmail.com wrote:
But is there any way to accomplish this without an array ? Even for 100!.
On 2 May
ya string one even will be more suitable way..
On Mon, May 3, 2010 at 5:33 PM, Rohit Saraf rohit.kumar.sa...@gmail.com wrote:
are forget abt representation. It can be stored as string anyways.
Tail recursion is awesome at times !
--
Rohit Saraf
take an long array of integer (to store the answer)
let Mod=1 (maximum allowable size or number in the array element
initialize the last element of array with 1
and know start multiplying the 1--n into the last number to first of array
if any number crosses the given then take
m=a[i]/mod
and
On Wed, Apr 28, 2010 at 10:16 PM, Vivek S s.vivek.ra...@gmail.com
wrote:
@Rajesh Patidar
I think we should do in Post order traversal alone. If we go by
Preorder/Inorder we might lose track of children node that is currently
being inserted into the BST. - correct me if im wrong :)
On 28
ignore the previous mail it wrongly send.
On Fri, Apr 30, 2010 at 11:12 PM, Rajesh Patidar patidarc...@gmail.com wrote:
let consider the list in two different part one traversing list B with
respect to A and A with B
(a.len,b.len) is always solution
a1=a2=a.len
On Fri, Apr 30, 2010 at 5:35
ya post order traversal will not have these problem theme time i
haven't thought the problem with pre and inorder.
On Wed, Apr 28, 2010 at 10:16 PM, Vivek S s.vivek.ra...@gmail.com wrote:
@Rajesh Patidar
I think we should do in Post order traversal alone. If we go by
Preorder/Inorder we might
PM, Ashish Mishra amishra@gmail.com wrote:
@rajesh can u explain your soln
how u r doing inorder, pre or whatever (without using stack) and at same
time build BST
On Wed, Apr 28, 2010 at 3:30 PM, Rajesh Patidar patidarc...@gmail.com
wrote:
pickup node in any order no matter(pre,post
pickup node in any order no matter(pre,post,inorder) and just one by
one. start adding the node into bst no need to use extra space u have
to just ditach the node from binary tree and attach it in bst.
On Wed, Apr 28, 2010 at 1:18 AM, Ashish Mishra amishra@gmail.com wrote:
How to build BST
i wanna to know how to find the kirst k digit of n^n
n can wary from 0n10^9
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
