Hello all,
Is it possible to get leaf nodes from inorder traversal of a binary
tree(not BST)?
--
Thank you
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To unsubscribe from this group and stop receiving emails from it, send an email
to
provide algo/code for construction of HAFT?
--
Regards,
Megha Agrawal
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To unsubscribe from this group and stop receiving emails from it, send an email
to algogeeks+unsubscr...@googlegroups.com
written exam consists of 2 sections:
1. Aptitude (consists of some Data interpretation and data analysis
questions)
2. Technical (basic C/C++ MCQs)
it doesn't contain any question on test cases.
On Thu, Aug 30, 2012 at 3:49 PM, Abhi abhi120@gmail.com wrote:
Can anyone tell me the type of
On Tuesday, August 21, 2012 8:23:21 AM UTC-5, megha agrawal wrote:
Can anyone suggest solution for this problem?
You are given an unsigned integer.Write a function to print the next
number which will be having same number of 1 bits present in given
num.
eg) 6(110) to 9(1001
Can anyone suggest solution for this problem?
You are given an unsigned integer.Write a function to print the next
number which will be having same number of 1 bits present in given num.
eg) 6(110) to 9(1001)
--
You received this message because you are subscribed to the Google
int mul(int a, int b)
{
int r=0;
if (a==0|| b==0)
r=0;
else
{
for(int i=0;ib;i++)
r=r+a;
}
return r;
}
On Wed, Jun 27, 2012 at 10:46 AM, Prateek Jain prateek10011...@gmail.comwrote:
main(a,b,m)
02{
03while (~scanf(%d%d,a,b))
04{
05 m=0;
06 while (a)
07
Hashmap can be used for effective retreival..
On Thu, Jun 14, 2012 at 4:23 PM, Mohit Rathi mohit08...@iiitd.ac.in wrote:
arr1 = [abc,xyz,lmn,def]
arr2 = [3,6,2,8]
if user enters xyz then 6 will be printed
else
if xyz doesn't exist in arr1 then ask for a number and add them in
respective
One function passes a pointer to the value of interest to another function.
Both functions can access the
value of interest, but the value of interest itself is not copied. This
communication is
called shallow. The alternative where a complete copy is made and sent is
known as a deep
copy.
On
