### 广度优先遍历(bfs)  ~~~ // 广度度优先遍历 public static void bfs(TreeNode node){ // 基于队列实现 Queue<TreeNode> queue = new LinkedList<>(); queue.offer(node); while(!queue.isEmpty()){ TreeNode cur = queue.poll(); System.out.print(cur.val+"->"); if(cur.left != null){ queue.offer(cur.left); } if(cur.right != null){ queue.offer(cur.right); } } } ~~~ ``` 宽度优先遍历：(wfs) 1->2->3->4->5->6->7-> ```