[LintCode] Binary Tree Level Order Traversal（二叉樹的層次遍歷）

描述

給出一棵二叉樹，返回其節點值的層次遍歷（逐層從左往右訪問）

樣例

給一棵二叉樹 {3,9,20,#,#,15,7} ：

3
 / \
9  20
  /  \
 15   7

返回他的分層遍歷結果：

[
  [3],
  [9,20],
  [15,7]
]

挑戰

挑戰1：只使用一個隊列去實現它

挑戰2：用BFS算法來作

代碼

GitHub 的源代碼，請訪問下面的連接：

https://github.com/cwiki-us/java-tutorial/blob/master/src/test/java/com/ossez/lang/tutorial/tests/lintcode/LintCode0069LevelOrderTest.java

 

package com.ossez.lang.tutorial.tests.lintcode;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;

import org.junit.Test;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

import com.ossez.lang.tutorial.models.TreeNode;

/**
 * <p>
 * 69
 * <ul>
 * <li>@see <a href=
 * "https://www.cwiki.us/display/ITCLASSIFICATION/Binary+Tree+Level+Order+Traversal">https://www.cwiki.us/display/ITCLASSIFICATION/Binary+Tree+Level+Order+Traversal</a>
 * <li>@see<a href=
 * "https://www.lintcode.com/problem/binary-tree-level-order-traversal">https://www.lintcode.com/problem/binary-tree-level-order-traversal</a>
 * </ul>
 * </p>
 * 
 * @author YuCheng
 *
 */
public class LintCode0069LevelOrderTest {

  private final static Logger logger = LoggerFactory.getLogger(LintCode0069LevelOrderTest.class);

  /**
   * 
   */
  @Test
  public void testMain() {
    logger.debug("BEGIN");
    String data = "{3,9,20,#,#,15,7}";

    TreeNode tn = deserialize(data);
    System.out.println(levelOrder(tn));

  }

  /**
   * Deserialize from array to tree
   * 
   * @param data
   * @return
   */
  private TreeNode deserialize(String data) {
    // NULL CHECK
    if (data.equals("{}")) {
      return null;
    }

    ArrayList<TreeNode> treeList = new ArrayList<TreeNode>();

    data = data.replace("{", "");
    data = data.replace("}", "");
    String[] vals = data.split(",");

    // INSERT ROOT
    TreeNode root = new TreeNode(Integer.parseInt(vals[0]));
    treeList.add(root);

    int index = 0;
    boolean isLeftChild = true;
    for (int i = 1; i < vals.length; i++) {
      if (!vals[i].equals("#")) {
        TreeNode node = new TreeNode(Integer.parseInt(vals[i]));
        if (isLeftChild) {
          treeList.get(index).left = node;
        } else {
          treeList.get(index).right = node;
        }
        treeList.add(node);
      }

      // LEVEL
      if (!isLeftChild) {
        index++;
      }

      // MOVE TO RIGHT OR NEXT LEVEL
      isLeftChild = !isLeftChild;
    }

    return root;

  }

  private List<List<Integer>> levelOrder(TreeNode root) {
    Queue<TreeNode> queue = new LinkedList<TreeNode>();
    List<List<Integer>> rs = new ArrayList<List<Integer>>();

    // NULL CHECK
    if (root == null) {
      return rs;
    }

    queue.offer(root);

    while (!queue.isEmpty()) {
      int length = queue.size();
      List<Integer> list = new ArrayList<Integer>();

      for (int i = 0; i < length; i++) {
        TreeNode curTN = queue.poll();
        list.add(curTN.val);
        if (curTN.left != null) {
          queue.offer(curTN.left);
        }
        if (curTN.right != null) {
          queue.offer(curTN.right);
        }
      }

      rs.add(list);
    }

    return rs;
  }
}

 

 

 

點評

這個程序可使用隊列的廣度優先算法來進行遍歷。

須要注意的是，由於在輸出結果的時候須要按照層級來進行輸出，那麼須要考慮的一個算法就是二叉樹的層級遍歷算法。

這個算法要求在遍歷的時候記錄樹的層級。