随笔分类 -  Data Structures

binary tree breadth first traversal in c++
摘要：BFS is faster to find shortest path from root to leaf node of a tree. But the tradeoff is to use more memory.the basic trategy is to maintain a list t... 阅读全文
posted @ 2014-11-11 03:43 Rui Yan 阅读(179) 评论(0) 推荐(0)