Q$.2($ solve using java$)$

Given an array of integers, write a method with a time complexity $O($Dlogn$)$ that returns

an array containing the counts of elements greater than every element in the array.

For example:

If the input array is: $\{4,6,8,1,9,11,5\}$

Then the returned array will be: $\{5,3,2,6,1,0,4\}$

Q$.3($solve using java$)$

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:

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 BinarxTreedode

$\{$

int data;

BinarxTreeNode leftchild $=$ null;

BinaryTreeNode rightchild $=$ null;

BinarxTreedode$($int data$)\{$

this$\_$data $=$ data;

$\}$

$\}$