摘要
在铁路调度站,当入口处车厢序列编号依次为1,2,3,……,n时,通过应用递归技术,求出了所有可能由此输出的长度为n的车厢序列。
If serial of the railway carriage is from I to n in the entrance to the dispatching station,we can get the serial numbers of the leaving trains whose length is n by recursive technique.
关键词
数据结构
栈
递归
遍历
状态二叉树
叶子结点
data structure
stack
recursive
traveral
state binary tree
leafy node
