Leetcode 965 | Univalued Binary Tree (Java Solution)

Univalued Bianry Trees are the ones where value of every node is same.

Leetcode problem: https://leetcode.com/problems/univalued-binary-tree/
problem statement:
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
system design: https://www.youtube.com/watch?v=jzPSuBiidF4&list=PLJN9ydlFnJsiEH_U9guHTNs6H2tH00h9S

DS for beginners: https://www.youtube.com/watch?v=cxjWjBPPbzI&list=PLJN9ydlFnJsiGBEhtBTL6Fj_2yxQFhYhS

leetcode solutions: https://www.youtube.com/watch?v=jVN6Mq0mXJo&list=PLJN9ydlFnJsgCQY0_UkzkG2pcds03XR0q

github: https://github.com/TheTechGranth/thegranths
facebook group : https://www.facebook.com/groups/741317603336313/
twitter: https://twitter.com/GranthTech

Видео Leetcode 965 | Univalued Binary Tree (Java Solution) канала The Tech Granth