Let $T$ be a tree on 100 vertices. Let $n_i$ be the number of vertices in $T$ which have exactly $i$ neighbors. Let $s= \Sigma_{i=1}^{100} i . n_i$ Which of the following is true?
Option B)
Take a Skewed tree.
Number of nodes =$n$
Number of nodes having neighbour $1=2( \text{root and the leaf})$
Number of nodes having neighbour $2=98(\text{Remaining Internal Nodes})$
$s=1\times 2+2\times 98=198$
Gatecse