奇怪為何別人的總是比較快....(?)
總之是一題送分題QQ
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
bool evaluateTree(struct TreeNode* root){
if (root->val == true)
return true;
if (root->val == false)
return false;
if (root->val==2) //OR
return evaluateTree(root->left)|| evaluateTree(root->right);
else //AND
return evaluateTree(root->left)&& evaluateTree(root->right);
}
沒有留言:
張貼留言