Register

Algorithm

696 views
0 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).

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Kenneth Rosen Ex 5.2Next → · test q
← Previous in category · AceTest Series: Algo...Next in category → · Gateforum-dynamic pr...
Position:
Show:

Related questions

4 4 votes
2 2 answers
556
556 views
gatecse asked Feb 23
556 views
GATE DA 2026 | Question: 15
You are given the following Pre-order and In-order traversals of a Binary Tree $T$ with nodes $E, F, G, P, Q, R, S$.\[\begin{array}{llllllll}\text{Pre-order:} & P & Q & S...
2 2 votes
1 1 answer
3.7k
3.7k views
go_editor asked Jul 7, 2016
3,676 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 isMinmax strategyAlpha-beta pruning strategyCo...
0 0 votes
1 1 answer
2.1k
2.1k views
humblefool asked Nov 7, 2017
2,139 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...