Hi guys,
How gcc or any c compiler maintains the scope of the variable?
Especially all the static variable are maintained in the data section.
Can anyone please respond.
--
--
If u doubt your believes,u believe ur doubts
If u f
We can find the solution in O(n) where n is number of nodes.
Do an in-order traversal of the binary tree. then scan through the numbers
and find the list and find the longest(increasing or decreasing) sequence.
That is the size of maximum size of BST in the given binary tree.
On Wed, Jun 23, 2010
I think you have to look at this book "Algorithms on Strings, Trees and
Sequences: Computer Science and Computational Biology"
By Dan gusfield. It has wonderful data structure which works really fast for
string operations.
On Wed, May 19, 2010 at 4:16 PM, vignesh radhakrishnan <
rvignesh1...@g