An <i>ordinal tree</i> is an arbitrary rooted tree where the children of each node are ordered. Succinct representations for ordinal trees with efficient query support have been extensively studied. The best previously known result is due to Geary et al. [2004b, pages 1--10]. The number of bits required by their representation for an <i>n</i>-node ordinal tree <i>T</i> is 2<i>n</i> + <i>o</i>(<i>n</i>), whose first-order term is information-theoretically optimal. Their representation supports a large set of <i>O</i>(1)-time queries on <i>T</i>. Based upon a balanced string of 2<i>n</i> parentheses, we give an improved 2<i>n</i> + <i>o</i>(<i>n</i>)-bit representation for <i>T</i>. Our improvement is two-fold: First, the set of <i>O</i>(1)-time queries supported by our representation is a proper superset of that supported by the representation of Geary, Raman, and Raman. Second, it is also much easier for our representation to support new queries by simply adding new auxiliary strings.