Meta Interview Question: Write an algorithm to verify if a tree is a binary search tree

Notifications

Meta interview question

Write an algorithm to verify if a tree is a binary search tree

Anonymous

28 Jul 2018

check if root >= left and root <= right and isBST(root.left) and isBST(root.right) checking if any node is null.

Anonymous

6 Mar 2019

Do in-order traversal, ensuring that the next node value you see is greater than current node value.