master-algorithms-py/dynamic_programming/bst_all_subnodes.py

#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# author: bt3gl


class Node:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right


def all_possible_bst(start, end, memo):

        result = []
        if start > end:
            return result
        
        if (start, end) in memo:
            return memo[(start, end)]

        for i in range(start, end + 1):
            left = all_possible_bst(start, i - 1, memo)
            right = all_possible_bst(i + 1, end, memo)

            for l in left:
                for r in right:
                    result.append(Node(i, l, r))

        memo[(start, end)] = result
        return result


def generate_trees(n):

    memo = {}
    return all_possible_bst(1, n, memo)