you give rooted tree consist n vertex the vertex number 1 n root vertex 1you perform follow operation k time choose edge v u tree v parent u remove edge v u add edge 1 u ie u subtree child root the height tree maximum depth vertex depth vertex number edge path root for example depth vertex 1 0 root depth child 1what smallest height tree achieve