摘要:
1 void levelOrder(Bitree* root){ 2 queue nodeQueue; 3 Node* pointer=root; 4 if(pointer){ 5 nodeQueue.push(pointer); 6 } 7 ... 阅读全文
posted @ 2014-11-26 20:45 Lyqatdl 阅读(156) 评论(0) 推荐(0)
posted @ 2014-11-26 20:45 Lyqatdl 阅读(156) 评论(0) 推荐(0)
posted @ 2014-11-26 14:31 Lyqatdl 阅读(361) 评论(0) 推荐(0)
posted @ 2014-11-26 14:22 Lyqatdl 阅读(138) 评论(0) 推荐(0)
posted @ 2014-11-26 13:22 Lyqatdl 阅读(303) 评论(0) 推荐(0)