摘要: 1.先上代码function Print(pRoot) { if (!pRoot) { return []; } var queue = [], result = [], flag = true; //头结点推入 queue.push(pRoot); while (queue.length) { var len = queue.l... 阅读全文
posted @ 2018-03-05 13:33 _Seve 阅读(712) 评论(0) 推荐(0)