Domanda di colloquio di Meta
Write an algorithm to verify if a tree is a binary search tree
Risposte di colloquio
Anonimo
28 lug 2018
check if root >= left and root <= right and isBST(root.left) and isBST(root.right) checking if any node is null.
Write an algorithm to verify if a tree is a binary search tree
Anonimo
check if root >= left and root <= right and isBST(root.left) and isBST(root.right) checking if any node is null.