Pergunta de entrevista da empresa Meta

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

Respostas da entrevista

Sigiloso

28 de jul. de 2018

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

Sigiloso

6 de mar. de 2019

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