In computer science one often encounters ordered trees. In Ref. [1] an algorithm is designed to generate all binary trees with n vertices. In [2] there is a slightly different approach to binary trees and ordered tree...In computer science one often encounters ordered trees. In Ref. [1] an algorithm is designed to generate all binary trees with n vertices. In [2] there is a slightly different approach to binary trees and ordered trees in general. In these and other papers sequences of integers related to ordered trees are of importance.展开更多
文摘In computer science one often encounters ordered trees. In Ref. [1] an algorithm is designed to generate all binary trees with n vertices. In [2] there is a slightly different approach to binary trees and ordered trees in general. In these and other papers sequences of integers related to ordered trees are of importance.
