Trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence are characterized. It is shown that such extremal trees can be obtained by breadth-first search where the vertex degrees ...