Interview Report
- 1of 1 vote
AnswersReturn the sum of all the leaf nodes at minimum level in a binary tree. If there exists no tree, then return -1.
- tarunreddy1018 August 23, 2016 in India| Report Duplicate | Flag | PURGE
- 1of 1 vote
AnswersGiven a BST and a number n, find two numbers in the tree that sums up to n. This was to be done in place i.e. without any extra space.
- tarunreddy1018 August 23, 2016 in India| Report Duplicate | Flag | PURGE
- 1of 1 vote
Answersgiven a sorted array in ascending order arrange the elements of array in such a way that largest element is at first position and second largest element at last position third largest at second position and fourth largest at last second position and so on.try to do it without any extra space.
- tarunreddy1018 August 23, 2016 in India| Report Duplicate | Flag | PURGE
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.