One Stop 4 Coders
Sunday, December 1, 2013
[Goldman Sachs]: Check if a tree is BST or not
Write a program with time complexity O(n) and space complexity O(1) to check if a tree is BST or not.
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment