CareerCup

hey can you explain your code more. you have taken different function where it is using not getting your point

@svsujeet ya that is what i also think,but interview told me ans like using recursion . even i told him many other soln.

k lets assume if two of them want to access same data at a time. means if you thread A want to access some data D. and thread B want to access data D at that time. then their would be conflict between them.

i told him that if i will use process then at a time i will use one process when it will completed then i will swap with another process.lets assume that if one task is taking 4bytes memory then in this way i will able to complete my task in only 4 bytes. but if i use 3 threads within one process then i have to use 12 bytes . then he told me lets assume you have lot of space.then which you would prefer.

@aju you can traverse how you want.. it doesn't matter. but not use extra memory :)

you can't use extra space for doubly link list .. you have only o(1) memory. and had to manipulate within BST.

@shreyas we can't use extra space.although he gave me hint using xor into two groups but i could not understand his logic :(

@anon ..i think nice soln. if we count number of nodes or levels of leaf node,so we can check that if remaining number of nodes is less than compare to BST which we found till now. then there would not check further.

@anon i always saw your soln upto mark.. can i have you mail id.

perhaps i understood that only in one time we have to get min element from aray.but i think every time we pop a element and that value should b min value remaining element in stack... SO MY ANS R WRONG

check every node of tree from its parent node and grandparent nodes too.when do recursive then it would have been check that grandparent node from their grandparent node.finally some point it would be checking from root value.

can you please tell me your algo.i don't think anyone doing here is correct for checking BST except inorder traversal and storing in array and then check it is sorted or not.
pls explain me your algo .
thanks

what about Trie. can we use Trie for phonebook?

i think raghu is saying correct.we have to modify stack the stack so that it gives min value in constant time.every time when we push the value in stack we have to check it is less than min value then simply push into stack
if not less than then pop min value from stack,push other value in it and then push min value on the top of stack.
at every time we will have min value in top of the stack, so we can get min value in constant time....

correct if i am wrong.

i think longest zigzag path would that path in binary tree.. = longest zigzag path in left subtree from root to leaf + longest zigzag path in right subtree from root to leaf.

which would be something like that =LRLRLRLRLR +RLRLRLRLRL
can any one tell me .. that this would be also zigzag path in tree like LLLRRLRLR
or LLLLLLLRRRRLLL or not.

@bg i knew that but i did not know wht to do. because i had to give that condition.
by the way you should pass argument ass node pointer in your function ,not value
sum(roo->link->data) //this is wrong,pass here link of node :)

hi akshay.shetye, i think the code will be like this because when you store it parent node it will update parent own value also.which could not recieved by grandparent. and i think it will update all node of tree with '0' value.

plz correct me if am wrong..

int sum(struct node* root)
{
if(root==null)return 0;
if(root->left==null) root->left->data=0; //correct me here if i am wrong
if(root->right==null) root->right->data=0;

root->data=root->left->data + root->right->data +sum(root->left)+sum(root->right);
return 0;
// i think every node of binary tree has been modified.
}