摘要
提出了一种对二叉树加线索的新方法,并给出了完备性证明。新算法生成的线索二叉树比传统的线索二叉树优越,从而使WBS搜索更加简单、有效。
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.
出处
《计算机工程》
CAS
CSCD
北大核心
2004年第16期104-105,共2页
Computer Engineering
关键词
工作分解结构
线索二叉树
遍历算法
软件程过能力成熟度模型
Work breakdown structure(WBS)
Threaded binary tree
Traversal algorithm
Capability maturity model for software(SW-CMM)
