Abstract
We give a combinatorial proof of the known result that there are exactlyn!/3 permutations of lengthn in the minmax tree representation of which theith node is a leaf.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
