A leaf of a plane tree is called an old leaf if it is the leftmost child of its parent, and it is called a young leaf otherwise. In this paper we enumerate plane trees with a given number of old leaves and young leaves. The formula is obtained combinatorially by presenting two bijections between plane trees and 2-Motzkin paths which map young leaves to red horizontal steps, and old leaves to up...