根據前序遍歷和中序遍歷重建二叉樹的Java實現

package cn.feng; class Node { Node left = null; Node right = null; char value; } public class BinaryTreeBuilder { /** * 根據前序遍歷和中序遍歷重建二叉樹子樹 * @param preOrder 前序遍歷數組 * @param start 子樹起始位置 * @param inOrder 中序遍歷數組 * @param end 中序遍歷結束位置 * @param length 子樹節點樹 * @return 子樹的根節點 */ public static Node buildTree(char[] preOrder, int start, char[] inOrder, int end, int length) { //參數驗證 if (preOrder == null || preOrder.length == 0 || inOrder == null || inOrder.length == 0 || length <= 0) { return null; } //建立子樹根節點 char value = preOrder[start]; Node root = new Node(); root.value = value; //遞歸終止條件：子樹只有一個節點 if (length == 1) return root; //分拆子樹的左子樹和右子樹 int i = 0; while (i < length) { if (value == inOrder[end - i]) { break; } i++; } //建立子樹的左子樹 root.left = buildTree(preOrder, start + 1, inOrder, end - i - 1, length - 1 - i); //建立子樹的右子樹 root.right = buildTree(preOrder, start + length - i, inOrder, end, i ); return root; } public static void main(String[] args) { char[] preOrder = new char[] {'a', 'b', 'd', 'c', 'e', 'f'}; char[] inOrder = new char[] {'d', 'b', 'a', 'e', 'c', 'f'}; Node root = buildTree(preOrder, 0, inOrder, inOrder.length - 1, inOrder.length); } }