https://github.com/ediloaz/bst-dynamic-vs-bst-greedy
Finds the BST optimal using a dynamic and a greedy algorithm. Analyze both trees and processing time of the solution (on Latex document).
https://github.com/ediloaz/bst-dynamic-vs-bst-greedy
binary-search-tree bstree c comparative-analysis dynamic-programming greedy-algorithms linux operations-research
Last synced: 4 months ago
JSON representation
Finds the BST optimal using a dynamic and a greedy algorithm. Analyze both trees and processing time of the solution (on Latex document).
- Host: GitHub
- URL: https://github.com/ediloaz/bst-dynamic-vs-bst-greedy
- Owner: ediloaz
- Created: 2018-08-05T19:08:07.000Z (about 7 years ago)
- Default Branch: master
- Last Pushed: 2018-08-06T03:27:29.000Z (about 7 years ago)
- Last Synced: 2025-06-21T18:09:57.379Z (4 months ago)
- Topics: binary-search-tree, bstree, c, comparative-analysis, dynamic-programming, greedy-algorithms, linux, operations-research
- Language: C
- Homepage:
- Size: 985 KB
- Stars: 0
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md