摘要： 提出了一种对二叉树加线索的新方法,并给出了完备性证明。新算法生成的线索二叉树比传统的线索二叉树优越,从而使WBS搜索更加简单、有效。
关键词:
工作分解结构,
线索二叉树,
遍历算法,
软件过程能力成熟度模型
Abstract: A new method in threading binary-trees and its proof of completeness are given. The threaded binary tree based on the new algorithm is superior to the traditional one, and thus makes the WBS searching simpler and more effectual.
中图分类号:
李志洁,黄飞雪,周东清. 基于线索二叉树的WBS算法[J]. , 2004, 30(16): 114-115.
LI ZHijie, HUANG Feixue, ZHOU Dongqing. WBS Algorithm Based on Threaded Binary Tree[J]. , 2004, 30(16): 114-115.