1 1 vote Consider the following algorithm findCenterAlgo that takes a tree $T$ as input.findCenterAlgo (T)1. Let $T_{\text {current }}$ be a copy of the input tree $T$.2. While the number of vertices in $T_{\text {current }}$ is greater than 2 :Identify all leaf nodes (nodes with degree 1 ) in $T_{\text {current }}$. Remove all of these leaf nodes and their incident edges from $T_{\text {current- }}$3. Output the number of vertices remaining in $T_{\text {current }}$.The output of findCenterAlgo ( $T$ ) for the tree shown in the given figure is $\_\_\_\_$ . Algorithms goclasses algorithms goclasses-cs-dpp goclasses-cs-dpp-day-93 goclasses-algorithms-practice-questions numerical-answers + – GO Classes 303 views answer comment Share Follow Print See 1 comment 1 1 comment reply edge_weight commented Jul 22 i moved by Misbah Ghaya Jul 22 reply Follow flag Hi @GO Classeswhats the ans to this r u guys following recursive approach like stripping up all leaf noddes.?? 0 0 replyShare Please log in or register to add a comment.