kislay.nsit
BAN USER
Comments (5)
Reputation 10
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
If the parent pointer is given, then we can simply think of the tree as a graph and do a BFS till level - k.
- kislay.nsit March 01, 2013Comment hidden because of low score. Click to expand.
0
of 0 vote
How would you keep track of which element came from which stream, especially after you have processed them to make a heap?
- kislay.nsit March 01, 2013Comment hidden because of low score. Click to expand.
0
of 0 vote
We can implement this Quicksort style - use 2 as pivot to shove all 1's to the left and 3's to the right.
- kislay.nsit February 28, 2013Comment hidden because of low score. Click to expand.
0
of 0 vote
You mean its a "classic" problem :)
Thanks for the link - right answer.
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
Perform reverse in-order traversal of the given BST and return when the k-th element is found.
- kislay.nsit March 06, 2013