https://www.geeksforgeeks.org/optimal-binary-search-tree-dp-24/
Optimal Binary Search Tree | DP-24 - GeeksforGeeks
A Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.
www.geeksforgeeks.org
https://en.wikipedia.org/wiki/Optimal_binary_search_tree
Optimal binary search tree - Wikipedia
In computer science, an optimal binary search tree (Optimal BST), sometimes called a weight-balanced binary tree,[1] is a binary search tree which provides the smallest possible search time (or expected search time) for a given sequence of accesses (or acc
en.wikipedia.org
'이론 > 알고리즘' 카테고리의 다른 글
| introsort 링크 & 고민 (0) | 2022.02.04 |
|---|---|
| Timsort - 구현 미정 (0) | 2021.05.17 |
댓글