LeetCode--95--medium--UniqueBinarySearchTreesII

package com.app.main.LeetCode.tree;

import com.app.main.LeetCode.base.TreeNode;

import java.util.ArrayList;
import java.util.List;

/**
 * 95
 *
 * medium
 *
 * https://leetcode.com/problems/unique-binary-search-trees-ii/
 *
 * Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1 ... n.
 *
 * Example:
 *
 * Input: 3
 * Output:
 * [
 *   [1,null,3,2],
 *   [3,2,null,1],
 *   [3,1,null,null,2],
 *   [2,1,3],
 *   [1,null,2,null,3]
 * ]
 * Explanation:
 * The above output corresponds to the 5 unique BST's shown below:
 *
 *    1         3     3      2      1
 *     \       /     /      / \      \
 *      3     2     1      1   3      2
 *     /     /       \                 \
 *    2     1         2                 3
 *
 *
 * Created with IDEA
 * author:Dingsheng Huang
 * Date:2019/11/4
 * Time:下午4:15
 */
public class UniqueBinarySearchTreesII {


    public List<TreeNode> generateTrees(int n) {
        if (n == 0) {
            return new ArrayList<>();
        }
        return process(1, n);
    }


    /**
     * 思路：
     * in-order traversal ， 用中序遍历思路看待，对于 1 到 n, 可以选定一个值作为 root， 1 到 n 以 root做分界线，
     * 分割两部分， 正好对应到 root的左右子树。 自顶向下递归，直到叶子节点
     *
     */
    private List<TreeNode> process(int start, int end) {
        List<TreeNode> result = new ArrayList<>();

        if (start > end) {
            result.add(null);
            return result;
        }

        if (start == end) {
            result.add(new TreeNode(start));
            return result;
        }

        for (int i = start; i <= end; i++) {
            List<TreeNode> leftList = process(start, i - 1);
            List<TreeNode> rightList = process(i + 1, end);

            for (TreeNode leftNode : leftList) {
                for (TreeNode rightNode : rightList) {
                    TreeNode root = new TreeNode(i);
                    root.left = leftNode;
                    root.right = rightNode;
                    result.add(root);
                }
            }
        }
        return result;
    }

}