retagged by
346 views
1 votes
1 votes

 

retagged by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
Shraddha dwevedi asked Nov 24, 2021
331 views
Q.which of the following data structure cannot be used for efficient implementation of Huffman encoding? a. Binary min heapb. Binary max heapc. AVL tree (height balanced ...
1 votes
1 votes
1 answer
2
Hira Thakur asked Aug 14, 2016
480 views
suppose a problem A reduces to problem B & reduction is done at $O(n^2)$ time.if the problem is solved in $O(n^3)$ time then what about the time of problem A___??$O(n^2)$...
0 votes
0 votes
1 answer
4
amit166 asked Nov 24, 2018
286 views
how many different trees possible with 5 nodes?