[1] GU N S,LI N Y,MANSOUR T.2-Binary trees:bijections and related issues [J].Discrete Math,2008,308:1209-1221. [2] PANHOLZER A,PRODINGER H.Bijections between certain families of labelled and unlabelled d-ary trees [J].Discrete Math,2009,3:123-136. [3] HONG S J,PARK S K.Hybrid d-ary trees and their generalization Bull [J].Korean Math,2014,51:229-235. [4] PALLO J.On the listing and random generation of hybrid binary trees [J].Computer Math,1994,50:135-145. [5] ROWLAND E S.Pattern avoidance in binary trees [J].Journal of Combinatorial Theory Series A,2010,117:741-758. [6] BERNINI A,FERRARI L,PINZANI R.Pattern-avoiding dyck paths [J].Discrete Mathematics & Theoretical Computer Science DMTCS,2013,AS:683-694. [7] YANG S L,JIANG M Y.The m-Schröder paths and m-Schröder numbers [J].Discrete Mathematics,2021,344:112209. [8] MERLINI D,SPRUGNOLI R.Lagrange inversion:when and how [J].Acta Applicandae Mathematicae,2006,94:233-249. |