Design an algorithm to verify that a tree is a universal value binary tree. Universal value binary tree means all value in that tree is the same.
There is two approach for this problem. One is with recursive function and another is with iterative function. For this problem, iterative function makes simpler answer. However, we have to learn using recursive function because in production code recursive function uses memory more efficiently while compared to iterative function.