算法复习 - 广度优先遍历、深度优先遍历（BFS、DFS）

最新推荐文章于 2022-03-20 10:40:09 发布

pokerface_lx

最新推荐文章于 2022-03-20 10:40:09 发布

阅读量384

点赞数

分类专栏：算法 java 文章标签：算法遍历 bfs dfs

本文链接：https://blog.csdn.net/pokerface_lx/article/details/51813494

版权

java 同时被 2 个专栏收录

13 篇文章 0 订阅

订阅专栏

算法

5 篇文章 0 订阅

订阅专栏

BinaryTreeNode.java

/**
* Created by apple on 16/6/18.
*/
public class BinaryTreeNode {

   private BinaryTreeNode leftNode;
   private BinaryTreeNode rightNode;
   private String root;

   public BinaryTreeNode() {
       this.leftNode = null;
       this.rightNode = null;
       this.root = null;
   }

   public BinaryTreeNode(String root) {
       this.leftNode = null;
       this.rightNode = null;
       this.root = root;
   }

   public BinaryTreeNode(BinaryTreeNode leftNode, BinaryTreeNode rightNode, String root) {
       this.leftNode = leftNode;
       this.rightNode = rightNode;
       this.root = root;
   }

   public BinaryTreeNode getLeftNode() {
       return leftNode;
   }

   public void setLeftNode(BinaryTreeNode leftNode) {
       this.leftNode = leftNode;
   }

   public BinaryTreeNode getRightNode() {
       return rightNode;
   }

   public void setRightNode(BinaryTreeNode rightNode) {
       this.rightNode = rightNode;
   }

   public String getRoot() {
       return root;
   }

   public void setRoot(String root) {
       this.root = root;
   }
}

BinaryTree.java

/**
* Created by apple on 16/6/18.
* 生成默认的二叉树,初始化
*/
public class BinaryTree {

   private BinaryTreeNode root;

   /**
    *          A
    *        /  \
    *       B    C
    *     /  \  / \
    *    D   E F  G
    *       / / \
    *      H I  J
    */
   public BinaryTree() {
       BinaryTreeNode node3_0 = new BinaryTreeNode("H");
       BinaryTreeNode node3_1 = new BinaryTreeNode("I");
       BinaryTreeNode node3_2 = new BinaryTreeNode("J");

       BinaryTreeNode node2_0 = new BinaryTreeNode("D");
       BinaryTreeNode node2_1 = new BinaryTreeNode(node3_0, null, "E");
       BinaryTreeNode node2_2 = new BinaryTreeNode(node3_1, node3_2, "F");
       BinaryTreeNode node2_3 = new BinaryTreeNode("G");

       BinaryTreeNode node1_0 = new BinaryTreeNode(node2_0, node2_1, "B");
       BinaryTreeNode node1_1 = new BinaryTreeNode(node2_2, node2_3, "C");

       root = new BinaryTreeNode(node1_0, node1_1, "A");
   }

   public BinaryTreeNode getRoot() {
       return root;
   }
}

##### BinaryTreeSearch.java

import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;

/**
* Created by apple on 16/6/18.
*/
public class BinaryTreeSearch {

   public static void BFS(BinaryTree tree) {
       Queue<BinaryTreeNode> openQueue = new LinkedList<>();
       Queue<BinaryTreeNode> closeQueue = new LinkedList<>();
       openQueue.add(tree.getRoot());
       while (openQueue.size() > 0) {
           if (openQueue.peek().getLeftNode() != null) {
               openQueue.add(openQueue.peek().getLeftNode());
           }
           if (openQueue.peek().getRightNode() != null) {
               openQueue.add(openQueue.peek().getRightNode());
           }
           System.out.print(openQueue.peek().getRoot());
           closeQueue.add(openQueue.poll());
       }
       System.out.println();
   }

   public static void DFS (BinaryTree tree) {
       Stack<BinaryTreeNode> openStack = new Stack<>();
       Stack<BinaryTreeNode> closeStack = new Stack<>();
       openStack.add(tree.getRoot());
       while (openStack.size() > 0) {
           closeStack.add(openStack.pop());
           System.out.print(closeStack.peek().getRoot());
           if (closeStack.peek().getRightNode() != null) {
               openStack.add(closeStack.peek().getRightNode());
           }
           if (closeStack.peek().getLeftNode() != null) {
               openStack.add(closeStack.peek().getLeftNode());
           }
       }
       System.out.println();
   }

}

##### Hello.java

/**
* Created by apple on 16/6/13.
*/
public class Hello {

   public static void main(String[] args) {
       BinaryTree tree = new BinaryTree();
       System.out.println("BFS");
       BinaryTreeSearch.BFS(tree);
       System.out.println("DFS");
       BinaryTreeSearch.DFS(tree);
   }

}

##### BinaryTreeNode.java

/**
* Created by apple on 16/6/18.
*/
public class BinaryTreeNode {

   private BinaryTreeNode leftNode;
   private BinaryTreeNode rightNode;
   private String root;

   public BinaryTreeNode() {
       this.leftNode = null;
       this.rightNode = null;
       this.root = null;
   }

   public BinaryTreeNode(String root) {
       this.leftNode = null;
       this.rightNode = null;
       this.root = root;
   }

   public BinaryTreeNode(BinaryTreeNode leftNode, BinaryTreeNode rightNode, String root) {
       this.leftNode = leftNode;
       this.rightNode = rightNode;
       this.root = root;
   }

   public BinaryTreeNode getLeftNode() {
       return leftNode;
   }

   public void setLeftNode(BinaryTreeNode leftNode) {
       this.leftNode = leftNode;
   }

   public BinaryTreeNode getRightNode() {
       return rightNode;
   }

   public void setRightNode(BinaryTreeNode rightNode) {
       this.rightNode = rightNode;
   }

   public String getRoot() {
       return root;
   }

   public void setRoot(String root) {
       this.root = root;
   }
}

##### BinaryTree.java

/**
* Created by apple on 16/6/18.
* 生成默认的二叉树,初始化
*/
public class BinaryTree {

   private BinaryTreeNode root;

   /**
    *          A
    *        /  \
    *       B    C
    *     /  \  / \
    *    D   E F  G
    *       / / \
    *      H I  J
    */
   public BinaryTree() {
       BinaryTreeNode node3_0 = new BinaryTreeNode("H");
       BinaryTreeNode node3_1 = new BinaryTreeNode("I");
       BinaryTreeNode node3_2 = new BinaryTreeNode("J");

       BinaryTreeNode node2_0 = new BinaryTreeNode("D");
       BinaryTreeNode node2_1 = new BinaryTreeNode(node3_0, null, "E");
       BinaryTreeNode node2_2 = new BinaryTreeNode(node3_1, node3_2, "F");
       BinaryTreeNode node2_3 = new BinaryTreeNode("G");

       BinaryTreeNode node1_0 = new BinaryTreeNode(node2_0, node2_1, "B");
       BinaryTreeNode node1_1 = new BinaryTreeNode(node2_2, node2_3, "C");

       root = new BinaryTreeNode(node1_0, node1_1, "A");
   }

   public BinaryTreeNode getRoot() {
       return root;
   }
}

##### BinaryTreeSearch.java

import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;

/**
* Created by apple on 16/6/18.
*/
public class BinaryTreeSearch {

   public static void BFS(BinaryTree tree) {
       Queue<BinaryTreeNode> openQueue = new LinkedList<>();
       Queue<BinaryTreeNode> closeQueue = new LinkedList<>();
       openQueue.add(tree.getRoot());
       while (openQueue.size() > 0) {
           if (openQueue.peek().getLeftNode() != null) {
               openQueue.add(openQueue.peek().getLeftNode());
           }
           if (openQueue.peek().getRightNode() != null) {
               openQueue.add(openQueue.peek().getRightNode());
           }
           System.out.print(openQueue.peek().getRoot());
           closeQueue.add(openQueue.poll());
       }
       System.out.println();
   }

   public static void DFS (BinaryTree tree) {
       Stack<BinaryTreeNode> openStack = new Stack<>();
       Stack<BinaryTreeNode> closeStack = new Stack<>();
       openStack.add(tree.getRoot());
       while (openStack.size() > 0) {
           closeStack.add(openStack.pop());
           System.out.print(closeStack.peek().getRoot());
           if (closeStack.peek().getRightNode() != null) {
               openStack.add(closeStack.peek().getRightNode());
           }
           if (closeStack.peek().getLeftNode() != null) {
               openStack.add(closeStack.peek().getLeftNode());
           }
       }
       System.out.println();
   }

}

##### Hello.java

/**
* Created by apple on 16/6/13.
*/
public class Hello {

   public static void main(String[] args) {
       BinaryTree tree = new BinaryTree();
       System.out.println("BFS");
       BinaryTreeSearch.BFS(tree);
       System.out.println("DFS");
       BinaryTreeSearch.DFS(tree);
   }

}

结果

pokerface_lx

关注

0
点赞
踩
1

收藏

觉得还不错? 一键收藏
0
评论
算法复习 - 广度优先遍历、深度优先遍历（BFS、DFS）

BinaryTreeNode.java/*** Created by apple on 16/6/18.*/public class BinaryTreeNode { private BinaryTreeNode leftNode; private BinaryTreeNode rightNode; private String root; public BinaryTr
复制链接

扫一扫