Postorder of BST from Preorder

Medium Binary Tree Construction

Log in to solve

Given the preorder traversal of a binary search tree with distinct keys, print its postorder traversal.

Constraints

1 <= n <= 10^5

No discussions yet.