LeetCode|2331. Evaluate Boolean Binary Tree

.

题目

You are given the root of a full binary tree with the following properties:

  • Leaf nodes have either the value 0 or 1, where 0 represents False and 1 represents True.

  • Non-leaf nodes have either the value 2 or 3, where 2 represents the boolean OR and 3 represents the boolean AND.

  • The evaluation of a node is as follows:

    • If the node is a leaf node, the evaluation is the value of the node, i.e. True or False.
    • Otherwise, evaluate the node's two children and apply the boolean operation of its value with the children's evaluations.
    • Return the boolean result of evaluating the root node.
  • A full binary tree is a binary tree where each node has either 0 or 2 children.

  • A leaf node is a node that has zero children.

Example 1:

  • Input: root = 2,1,3,null,null,0,1
  • Output: true
  • Explanation: The above diagram illustrates the evaluation process.
    The AND node evaluates to False AND True = False.
    The OR node evaluates to True OR False = True.
    The root node evaluates to True, so we return true.

Example 2:

  • Input: root = 0
  • Output: false
  • Explanation: The root node is a leaf node and it evaluates to false, so we return false.

Constraints:

  • The number of nodes in the tree is in the range 1, 1000.
  • 0 <= Node.val <= 3
  • Every node has either 0 or 2 children.
  • Leaf nodes have a value of 0 or 1.
  • Non-leaf nodes have a value of 2 or 3.

.

思路

仍然是DFS,需要对每个node进行判断:

  • 如果node是null,直接返回True
  • 如果node的val等于0或者1,直接返回val值
  • 如果node的val等于2,需要进行二元操作or
  • 如果node的val等于3,需要进行二元操作and

优化思路:

  • 题目中标注该二叉树为full binary tree,即完全二叉树
  • 当node的左节点为空的时候,则该节点为叶子节点

.

代码

python 复制代码
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def evaluateTree(self, root: Optional[TreeNode]) -> bool:
        if not root.left:
            return root.val
        if root.val == 2:
            return self.evaluateTree(root.left) or self.evaluateTree(root.right)
        if root.val == 3:
            return self.evaluateTree(root.left) and self.evaluateTree(root.right)
        

.

相关推荐
是main不是漫2 小时前
【快慢指针 | LeetCode202 快乐数】鸽巢原理佐证环特性,快慢指针巧解快乐数
c语言·开发语言·c++·算法
Felven3 小时前
A. Iskander and Drawings
算法
Wellijohn4 小时前
我把公司内部的 12 个 CRUD 接口交给了 AI Agent,然后省出了两周
人工智能·python·mcp
2601_967980115 小时前
python pytest怎样测试代码
python·pytest·测试·文档·断言
伞伞悦读5 小时前
【第92期】逻辑回归的分数概率与阈值的实验与排查
人工智能·python·深度学习·机器学习
ch6236 小时前
🚀 从零构建本地文档智能审查 Agent:Vibe Coding 实战指南
python
qq_348231856 小时前
大模型算法: 反向传播
算法
摇滚侠7 小时前
《On Java 中文版 基础卷》阅读笔记 接口 18
java·笔记·python
电科_银尘7 小时前
【大模型算法与工程 27】训练配方:批量、学习率、精度与梯度裁剪
学习·算法·机器学习
Thanks_ks7 小时前
AI Agent 开发入门:用 Function Calling 让大模型学会 “动手干活”,附订单查询机器人实战
python·ai·大模型·openai·agent·通义千问·mcp