$?$

tion 3 vet ered ed out of What does this code do? if (node == null) { return true; } ag question if (node.key max) { } return false; return (is FUN (node: node.left, min, node.key-1) && is FUN (node: node.right, node.key+1, max)) ; O A. Checks if a binary tree is a complete binary tree. O B. Checks if a binary tree is a binary search tree. OC. Checks if a binary tree is a full binary tree. O D. Checks if a binary tree is a perfect binary tree.