Abstract
The stack size of an ordered tree is the maximum number of nodes stored in the stack during postorder-traversing of the tree. This paper gives a one-to-one correspondence between t-ary ordered trees with tk + 1 nodes and stack size s + 1, and ordered trees with ( t−1) k + 1 nodes, allowed node degrees d 0 mod ( t−1) and stack size s.
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
