Traversals

Computer Science Level 3

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

O ( n ) O(n) O ( n 2 ) O(n^{2}) O ( log ⁡ ( n ) ) O(\log(n)) O ( n log ⁡ ( n ) ) O(n\log(n))

Beakal Tiliksew by Beakal Tiliksew , 24, Ethiopia

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...