CareerCup Given preorder traversal array of a BST, recontruct the BST.

最新推荐文章于 2022-08-05 10:34:23 发布

taoqick

最新推荐文章于 2022-08-05 10:34:23 发布

阅读量717

点赞数 1

分类专栏： careercup c++ 算法

算法同时被 3 个专栏收录

474 篇文章 6 订阅

订阅专栏

c++

265 篇文章 1 订阅

订阅专栏

careercup

86 篇文章 0 订阅

订阅专栏

Given preorder traversal array of a BST, recontruct the BST.

---------------------------------------------------------------

I like this solution!!!!!!!!!!

This can be solved in O(n) only. The approach am using is, keep a separate stack of node pointers. Push on the 1st node. Keep on traversing the preorder traversal
1. if the value of stack top is more than the current node value, then make the current node left pointer of stack top.
2. if the value of stack top is less that current node value, keep popping from the stack till value of stack top is more than current node. Then make current node the right child of last popped element.
Push the current node on stack in both the cases.

It may seem like an O(n^2) algo, but we are pushing and popping every element on stack only once so this is O(n) time and space.

Please check ideone.com/VohnS for details