A Sharp Upper Bound for the Complexity of Labeled Oriented Trees