堆栈内存溢出
  简体   繁体   English

动态编程：最优二叉搜索树和霍夫曼

[英]Dynamic Programming:optimal Binary search tree and Huffman

 原文  2013-04-04 13:00:12  9   1    algorithm/ binary-search-tree/ dynamic-programming/ huffman-code

问题描述

Is it possible to construct an optimal Binary search tree (OBST) via a greedy algorithm instead of with Dynamic Programming (DP) (for example Huffman's algorithm)? 是否可以通过贪婪算法而不是动态规划（DP）（例如霍夫曼算法）来构造最佳二叉搜索树（OBST）？ If so why is DP is preferred in the construction of a OBST? 如果是这样，为什么在OBST的构造中首选DP？

1 个解决方案

解决方案1
 0  2013-04-04 16:13:28

There are no efficient greedy algorithms to always construct an optimal binary search tree. 没有有效的贪心算法来始终构造最佳的二叉搜索树。 However there are likely to be heuristics such as greedy algorithms that construct nearly optimal trees, which may be preferable in practice. 但是，可能会有启发式算法（例如贪婪算法）构造几乎最佳的树，这在实践中可能更可取。

暂无
暂无

声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

相关问题 动态规划：最优二叉搜索树 - Dynamic Programming: Optimal Binary Search Tree 创建最佳二叉搜索树，与创建霍夫曼树一样？ - Creating an optimal binary search tree, same as creating a huffman tree? 动态规划：为什么 Knuth 改进了最优二叉搜索树 O(n^2)？ - Dynamic Programming: Why Knuth's improvement to Optimal Binary Search Tree O(n^2)? 最优二叉搜索树 - TimeComplexity - Optimal binary search Tree - TimeComplexity 最佳二叉搜索树-Cormen - Optimal binary search tree - Cormen 成功和不成功搜索的最佳二叉搜索树 - Optimal Binary Search Tree for Successful and Unsuccessful Search 生成最优二叉搜索树（Cormen） - Generating an optimal binary search tree (Cormen) 动态编程帮助：二叉树成本边缘 - Dynamic Programming Help: Binary Tree Cost Edge 添加频率总和，求解最佳二叉树 - Adding sum of frequencies whille solving Optimal Binary search tree O(n^2) 中的 Knuth 最优二叉搜索树 - Knuth's Optimal Binary Search tree in O(n^2)
相关标签
 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM