Register

Algorithm

441 views
0 votes
0 votes
1. What is the time complexity to design BST from given postorder and inorder traversal?

2. What is the time complexity to design BST from given postorder only.

 

I know time to design BST from Preorder is O(n).
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
1 answer
1
go_editor asked Jul 7, 2016
2,820 views
UGC NET CSE | June 2012 | Part 3 | Question: 51
The strategy used to reduce the number of tree branches and the number of static evaluations applied in case of a game tree is Minmax strategy Alpha-beta pruning strategy Constraint satisfaction strategy Static max strategy
The strategy used to reduce the number of tree branches and the number of static evaluations applied in case of a game tree isMinmax strategyAlpha-beta pruning strategyCo...
User Avatar
0 votes
0 votes
1 answer
2
humblefool asked Nov 7, 2017
1,153 views
Binary Tree construction
Given the preorder/postorder and inorder traversal of a binary tree, we can always construct a unique binary tree (I think so, correct me if I am wrong) Construct a binary tree with the nodes A, B, C such that its preorder traversal is ABC and its inorder traversal is CAB.
Given the preorder/postorder and inorder traversal of a binary tree, we can always construct a unique binary tree (I think so, correct me if I am wrong)Construct a binary...
User Avatar
0 votes
0 votes
0 answers
3
Vikas123 asked Jan 8, 2019
719 views
PRE-ORDER, POST-ORDER IN-ORDER
Acc. to (question) my solution is... uniquely constructed binary tree PRE+POST and IN+POST… where i am wrong….
Acc. to (question) my solution is...uniquely constructed binary tree PRE+POST and IN+POST…where i am wrong….
User Avatar
Link Copied!