Register

#Huffman code

349 views
2 votes
2 votes
What if there are multiple nodes with the same low frequency while constructing tree?? In that case how we consider nodes??
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
saptarshiDey asked Jan 3, 2019
8,185 views
Time Complexity of Code snippet
What will be the worst case time complexity for the following code segment? int count=0,N; for(i=0;i<N*2;i++){ for(j=0;j<i/3;i++){ for(k=0;k<j*j;k++){ count++; } } } Options: O(N^4) O(N^3) O(N^2) O(N)
What will be the worst case time complexity for the following code segment?int count=0,N; for(i=0;i<N*2;i++){ for(j=0;j<i/3;i++){ for(k=0;k<j*j;k++){ count++; } } }Option...
User Avatar
0 votes
0 votes
1 answer
2
GateAspirant999 asked Sep 16, 2018
982 views
Time complexity of code given
User Avatar
0 votes
0 votes
1 answer
3
highheels10 asked Sep 15, 2018
496 views
what is the time complexity of this code
User Avatar
0 votes
0 votes
2 answers
4
radha gogia asked Jul 7, 2018
1,588 views
what is the time complexity of below code ?
foo(int n) { for(int i=0 ; i<n ;i++) for(int j=i ; j<=i*i ;j++) if(j%i==0) { for(int k=0;k<j;k++) printf("hii"); } } How to proceed here for analyzing the time complexity ?
foo(int n) { for(int i=0 ; i<n ;i++) for(int j=i ; j<=i*i ;j++) if(j%i==0) { for(int k=0;k<j;k++) printf("hii"); } } How to proceed here for analyzing the time complexity...
User Avatar
Link Copied!