论文标题
有序树的灰色代码
A Gray Code of Ordered Trees
论文作者
论文摘要
一组组合对象的组合灰色代码是集合中所有组合对象的一个序列，因此每个对象都会通过更改小零件来从先前的对象派生。 在本文中，我们为有N顶点的有序树设计了一个灰色代码，以使每个有序的树从前一个有序的树中得出，然后去除叶子然后在其他地方附加叶子。因此，更改只是删除并涂抹叶子，这是最小值。
A combinatorial Gray code for a set of combinatorial objects is a sequence of all combinatorial objects in the set so that each object is derived from the preceding object by changing a small part. In this paper we design a Gray code for ordered trees with n vertices such that each ordered tree is derived from the preceding ordered tree by removing a leaf then appending a leaf elsewhere. Thus the change is just remove-and-append a leaf, which is the minimum.
