);
if(!check_palin(v))
return false;
v.clear();
if(q.front() == NULL)
break;
q.push(NULL);
}
return true;
}
On Fri, Sep 6, 2013 at 3:12 AM, subrat kumar prasad iitr.s...@gmail.comwrote:
1. take the nodes at current level i in an array.
2
1. take the nodes at current level i in an array.
2. check if the current level is palindrome.
On Mon, Sep 2, 2013 at 3:25 PM, Bhawin bhawinkumar.thu...@gmail.com wrote:
Given a binary tree design an algorithm to check if the tree is a
palindrome tree or not.
Palindromic tree: String
can anyone provide working code for biginteger in c++?
please upload!!
--
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
@bharat: how do u count lift movement? Is it taking a person from any
random floor to any random floor as 1 count or the number of floor it goes
through to drop a person.
for example : if 3 1 2 is the given input. Here person 1 wants to go to
floor 3. Taking him to its respective floor counts 1 or
