Traversals

Given the post-order traversal \(T\) of a binary search tree on \(n\) elements \((1, 2,\cdots, n\)), what is the time complexity of the most efficient algorithm for determining a unique binary tree that as \(T\) as its post-order traversal?

×

Problem Loading...

Note Loading...

Set Loading...