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

Question d’entretien chez Meta

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

Utilisateur anonyme

28 juil. 2018

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

Utilisateur anonyme

6 mars 2019

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