Breadth-first Search

BFS遍历树状结构

最新推荐文章于 2022-07-08 09:35:21 发布

原创最新推荐文章于 2022-07-08 09:35:21 发布 · 286 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种使用广度优先搜索（BFS）策略遍历树状结构的方法。通过实现Node类的breadthFirstSearch方法，文章详细展示了如何将节点名称存储到数组中并返回，特别强调了从左至右遍历树的过程。提供了两种解决方案，分别使用LinkedList和ArrayDeque作为队列实现。

Prompt

You’re given a Node class that has a name and an array of optional children nodes. When put together, nodes form an acyclic tree-like structure.

Implement the breadthFirstSearch method on the Node class, which takes in an empty array, traverses the tree using the Breadth-rst Search approach (specically navigating the tree from left to right), stores
all of the nodes’ names in the input array, and returns it.

Sample Input

在这里插入图片描述

Sample Output

["A", "B", "C", "D", "E", "F", "G","H", "I", "J", "K"]

Solution

import java.util.*;

class Program {
  // Do not edit the class below except
  // for the breadthFirstSearch method.
  // Feel free to add new properties
  // and methods to the class.
  static class Node {
    String name;
    List<Node> children = new ArrayList<Node>();

    public Node(String name) {
      this.name = name;
    }

    public List<String> breadthFirstSearch(List<String> array) {
			Queue<Node> queue = new LinkedList<Node>();
			queue.add(this);
			while(queue.size() > 0) {
				Node current = queue.poll();
				array.add(current.name);
				queue.addAll(current.children);
			}
      return array;
    }

    public Node addChild(String name) {
      Node child = new Node(name);
      children.add(child);
      return this;
    }
  }
}

Solution 2

import java.util.*;

class Program {
  // Do not edit the class below except
  // for the breadthFirstSearch method.
  // Feel free to add new properties
  // and methods to the class.
  static class Node {
    String name;
    List<Node> children = new ArrayList<Node>();

    public Node(String name) {
      this.name = name;
    }

    public List<String> breadthFirstSearch(List<String> array) {
			ArrayDeque<Node> queue = new ArrayDeque<Node>();//A

			queue.add(this);
			while(queue.size() > 0) {
				Node current = queue.pollFirst();
				array.add(current.name);
				queue.addAll(current.children);//CURRENT>CHILDREN
			
			}
      return array;
    }

    public Node addChild(String name) {
      Node child = new Node(name);
      children.add(child);
      return this;
    }
  }
}

#A

the methods of ArrayDeque and Queue