public void sortChildrenByContent ( Comparator < ? super T > comparator ) { Comparator < TreeNode < T >> byContent = Comparator . comparing ( TreeNode :: getContent , comparator ) ; sortChildrenByNode ( byContent ) ; }
Recursively sorts all children using the given comparator of their content .