From phone interview: write a function to verify a BST
Utilisateur anonyme
public bool VerifyBst (node root) { if (node == null) { return false; } if (node.leftChild == null && node.rightChild == null) { return true; } Queue nodes = new Queue(); nodes.push(root); while (nodes.Count != 0) { node currentNode = nodes.pop(); if (currentNode.leftChild != null) { if (currentNode.leftChild.value currentNode.value) { nodes.push(currentNode.rightChild); } else { return false; } } } return true; }