Add prompt and solution for LC 965. Univalued Binary Tree

Author: timothyshores

965. Univalued Binary Tree.js

@@ -0,0 +1,62 @@
+/*
+
+965. Univalued Binary Tree
+
+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
+
+*/
+
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+
+/**
+ * @param {TreeNode} root
+ * @return {boolean}
+ */
+const isUnivalTreeDepth = (root) => {
+    const dfs = node => {
+        if (!node) return true;
+        return node.val === root.val && dfs(node.left) && dfs(node.right);
+    }
+
+    return dfs(root);
+};
+
+/**
+ * @param {TreeNode} root
+ * @return {boolean}
+ */
+const isUnivalTreeBreadth = (root) => {
+    const queue = [root];
+
+    while (queue.length) {
+        const curr = queue.pop();
+        if (curr.val !== root.val) return false;
+        if (curr.left) queue.unshift(curr.left);
+        if (curr.right) queue.unshift(curr.right);
+    }
+
+    return true;
+};

README.md

@@ -51,7 +51,8 @@ LeetCode Profile: https://leetcode.com/timothyshores/
 |[844. Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/)|Easy|[JavaScript](844.%20Backspace%20String%20Compare.js.js)
 |[836. Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap/)|Easy|[JavaScript](836.%20Rectangle%20Overlap.js)
 |[896. Monotonic Array](https://leetcode.com/problems/monotonic-array/)|Easy|[JavaScript](896.%20Monotonic%20Array.js)
-|[938. Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/)|Medium|[JavaScript](938.%20Range%20Sum%20of%20BST.js) 
+|[938. Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/)|Medium|[JavaScript](938.%20Range%20Sum%20of%20BST.js)
+|[965. Univalued Binary Tree.js](https://leetcode.com/problems/univalued-binary-tree/)|Easy|[JavaScript](965.%20Univalued%20Binary%20Tree.js)
 |[1047. Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/description/)|Easy|[JavaScript](1047.%20Remove%20All%20Adjacent%20Duplicates%20In%20String.js 
 |[1108. Defanging An IP Address](https://leetcode.com/problems/defanging-an-ip-address/)|Easy|[JavaScript](1108.%20Defanging%20An%20IP%20Address.js)
 |[1170. Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/)|Medium|[JavaScript](1170.%20Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character.js)