Write a method that receives the root of a binary tree and finds the count of all subtrees having the same value in all of its nodes. For example: if the method receives the root of the following tree: A It will return 7 because the following subtrees have the same value in all of its nodes: Note: binary tree is constructed of nodes which are instances of the following class: class Binary TreeNode { int data; Binary TreeNode leftchild = null; Binary TreeNode rightchild = null; Binary TreeNode(int data) { this.data = data; }