Question

consider you
are given the post order traversal p of a binary search tree of 'n' elements starting
from 1 to n. If you need to determine the unique binary search tree that has p as its post order traversal.what is time
complexity of the most
gon
you
given the post-order traversal P as its post order traversal.what is the time complexity of the most

efficient algorithm for doing this?
(A) 0(log in)
(B)0(log n)
(C) 0(nlog,n)
(D) None of these, as the tree cannot be unqinely deter
mined​

Answer 1

Answer:

a)

Explanation:

mark me brilliantest