A binary tree is univalued if every node in the tree has the same value. Return true if and only if the given tree is univalued. Example 1: Input: [1,1,1,1,1,null,1] Output: true Example 2: Input: [2,2,2,5,2] Output: false Note: The number of nodes i…

public class Solution { List<int> list = new List<int>(); private void postTree(TreeNode root) { if (root != null) { list.Add(root.val); if (root.left != null) { postTree(root.left); } if (root.right != null) { postTree(root.right); } } } publ…

如果二叉树每个节点都具有相同的值,那么该二叉树就是单值二叉树. 只有给定的树是单值二叉树时,才返回 true:否则返回 false. 示例 1: 输入:[1,1,1,1,1,null,1] 输出:true 示例 2: 输入:[2,2,2,5,2] 输出:false 提示: 给定树的节点数范围是 [1, 100]. 每个节点的值都是整数,范围为 [0, 99] . class Solution { public: int val = -1; bool isUnivalTree(TreeNode*…

题目 1 class Solution { 2 public: 3 int flag = 0; 4 bool isUnivalTree(TreeNode* root){ 5 isUnivalTree1(root,root->val); 6 if(flag == 0) return true; 7 else return false; 8 } 9 void isUnivalTree1(TreeNode* root,int tmp) { 10 if(root!=NULL){ 11 isUnivalT…