Register

time complexity of various algorithms

256 views
3 votes
3 votes
what are the Time Cmplexity of following:

1.preorder traversal

2.postorder traversal

3.inoder traversal

4.inorder to preorder

5.inorder to postorder

6.infix to prefix

7.infix to postfix

8.prefix to infix

9.postfix to infix

10.postfix to prefix

11.prefix to postfix
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

2 votes
2 votes
0 answers
2
sh!va asked Jul 22, 2016
532 views
Compare the performance of various cryptographic algorithms
Compare the performance of various cryptographic algorithms A) p- AES q-3 DES r- DES s- RSA x-S box y- P box B) p- AES q-3 DES r- DES s- RSA x-P box y- S box C) p- RSA q-AES r-3 DES s- DES x-S box y- P box D) p- RSA q-AES r-3 DES s- DES x-P box y- S box
Compare the performance of various cryptographic algorithmsA) p- AES q-3 DES r- DES s- RSA x-S box y- P boxB) p- AES q-3 DES r- DES s- RSA x-P box y- S boxC) p- RSA q-AES...
User Avatar
2 votes
2 votes
2 answers
3
Parshu gate asked Nov 13, 2017
671 views
Time complexity of algorithms
In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity by (A) Dijkstra's algorithm starting from S (B) Warshall's algorithm (C) performing a DFS starting from S (D) performing a BFS starting from S
In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity by (A) Dij...
User Avatar
0 votes
0 votes
1 answer
4
Rackson asked Jan 12, 2019
970 views
Algorithms Time complexity
User Avatar
Link Copied!