Most answered questions in Programming and DS

31 votes
5 answers
153
State whether the following statements are TRUE or FALSE:It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given?
2 votes
5 answers
154
4 votes
5 answers
156
Consider the following binary search tree T given below: Which node contains the fourth smallest element in T?QVWX
9 votes
5 answers
157
The for loopfor (i=0; i<10; ++i) printf("%d", i&1);prints0101010101011111111100000000001111111111
10 votes
5 answers
161
5 votes
5 answers
162
______ is the number of moves of the smallest disc in Tower of Hanoi implementation where the tower consisting of 17 discs (numbered from 0 to 16)Answer given: $2^{16}$ ...
7 votes
5 answers
164
Consider the following program fragment if(a b) if(b c) s1; else s2;s2 will be executed ifa <= bb cb >= c and a <= ba b and b <= c
0 votes
5 answers
166
If I am given an array $X$ of $n$ distinct integers which is interpreted as a complete binary tree, so if the parent is at index $i$, then it's left child would be at ind...
2 votes
5 answers
168
The minimum number of fields with each node of doubly linked list is1234
2 votes
5 answers
169
void myfunc(int X){ if(X 0) myfunc( X ); printf("%d", X); } int main(){ myfunc(5); return 0; }0,0,1,2,3,44,3,2,1,04,3,2,1,0,00,1,2,3,4