Coding Interview Questions: No. 06 - Post-order Traversal Sequences of Binary Search Trees Problem: ...

Please Visit: http://ift.tt/1ajReyV

Coding Interview Questions: No. 06 - Post-order Traversal Sequences of Binary Search Trees

Problem: Determine whether an input array is a post-order traversal sequence of a binary tree or not. If it is, return true; otherwise return false. Assume all numbers in an input array are unique.

http://ift.tt/WjCJvn

http://ift.tt/1p3c1Rz

Coding Interview Questions: No. 06 - Post-order Traversal Sequences of Binary Search Trees

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/WjCJvr

via LifeLong Community