Question
Which traversal method of a Binary Search Tree will
always output elements in ascending order?Solution
In-order traversal (Left -> Root -> Right) of a Binary Search Tree visits nodes in non-decreasing (ascending) order of their values.
A alone can finish a piece of work in 12 days and B alone in 18 days. They work together for 4 days, then B leaves and C joins A. A and C together finis...
A and B together can complete a piece of work in 12 days, while B and C can complete it in 15 days. A, B, and C together can complete the same work in 8...
A can finish a piece of work in 15 days and B can finish it in 20 days. They work together for 4 days and then B leaves. In how many more days can A alo...
A can complete a piece of work in 10 days. B in 15 days and C in 20 days. A and C worked together for two days and then A was replaced by B. In how many...
Puneet and Qureshi together can complete (7/8)th of a piece of work in 9 days, Qureshi and Rohit together can complete (3/5)th of the work in 8 days and...
A, B, and C each have different rates of completing a task; A can finish it in 36 days, B in 60 days, and C in 30 days. Initially, they begin the work c...
P, Q and R can do some work in 11 days, 20 days and 55 days respectively. In how many days can the work be done, if P gets the assistance of Q and R on ...
‘A’ and ‘B’ can do a piece of work in 25 days and 30 days, respectively. If they started the work together and worked on it for 8 days, then fin...
A can do a work in 30 hours while B can do it in 20 hours. If C is 60% more efficient than A and B together, then find the time taken by C alone to comp...
‘M’ and ‘N’ together can do a piece of work in 50 days. If ‘M’ is 50% more efficient than ‘N’, how long will ‘N’ take to do the work...
