坚持到底就是胜利

tree algorithm

1.  travel tree without stack or recursive
2. three travel using none recursive
3. delete a element in binary search tree
4. count words(using bst)
5. level-travel(using queue)
   

posted on 2006-11-21 22:11 ailab 阅读(253) 评论(0)  编辑 收藏 引用