Convert the prüfer code of a tree into a list of directed edges in O(n×log₂n) compute time where n is node count.
O(n×log₂n)
n
Convert the prüfer code of a tree into a list of directed edges in
O(n×log₂n)compute time wherenis node count.