4.A rooted binary tree can be viewed as a directed graph with on source (i.e., the root) and vertices than can have no more than two outgoing edges. Leaf vertices are sinks. Provide an algorithm that...

4.A rooted binary tree can be viewed as a directed graph with on source (i.e., the root) and vertices than can have no more than two outgoing edges. Leaf vertices are sinks. Provide an algorithm that checks if a rooted binary tree is unbalanced (i.e., the longest path from the root to a leaf vertex is twice the shortest path from the root to a leaf vertex). Place your algorithm in a time complexity class.