mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-05-02 14:56:27 -04:00
Update and rename all_subnotes_bst.py to bst_all_subnodes.py
This commit is contained in:
parent
aca9429097
commit
6b3923e32c
1 changed files with 5 additions and 5 deletions
39
trees/bst_all_subnodes.py
Normal file
39
trees/bst_all_subnodes.py
Normal file
|
@ -0,0 +1,39 @@
|
|||
#!/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:
|
||||
result.append(None)
|
||||
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:
|
||||
root = Node(i, l, r)
|
||||
result.append(root)
|
||||
|
||||
memo[(start, end)] = result
|
||||
return result
|
||||
|
||||
|
||||
def generate_trees(n):
|
||||
|
||||
memo = {}
|
||||
return all_possible_bst(1, n, memo)
|
Loading…
Add table
Add a link
Reference in a new issue