Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0901_1000.s0965_univalued_binary_tree.Solution

```
public class Solution
extends Object
```
965 - Univalued Binary Tree.
Easy

A binary tree is uni-valued if every node in the tree has the same value.

Given the root of a binary tree, return true if the given tree is uni-valued , or false otherwise.

Example 1:

Input: root = [1,1,1,1,1,null,1]

Output: true

Example 2:

Input: root = [2,2,2,5,2]

Output: false

Constraints:
- The number of nodes in the tree is in the range [1, 100].
- 0 <= Node.val < 100

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  boolean isUnivalTree(TreeNode root)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

isUnivalTree

public boolean isUnivalTree(TreeNode root)