ScholarLens Back to search
2016•Advances in intelligent systems research/Advances in Intelligent Systems ResearchOpen access

Construct Optimal Binary Search Tree by Using Greedy Algorithm

Chun Sheng Shi, Ming Jian Zhao, Chunyu Li, Chunlei Lin, Zhengjie Deng

Open full text 0 citations

Abstract

Focus on some constructions of binary tree, there are many methods to resolve this problem.With analyzes between binary search tree and Huffman tree, we introduce information retrieval issue and compare the Huffman tree with optimal binary search tree.And we further present a method that use greedy algorithm to construct binary search tree and use C++ to realize method.Experimental provides some conclusions that greedy algorithm is more efficiency than dynamic programming algorithm.

Open-access reader

About this research paper

What this paper is about

Focus on some constructions of binary tree, there are many methods to resolve this problem.With analyzes between binary search tree and Huffman tree, we introduce information retrieval issue and compare the Huffman tree with optimal binary search tree.And we further present a method that use greedy algorithm to construct binary search tree and use C++ to realize method.Experimental provides some conclusions that greedy algorithm is more efficiency than dynamic programming algorithm.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Focus on some constructions of binary tree, there are many methods to resolve this problem.With analyzes between binary search tree and Huffman tree, we introduce information retrieval issue and compare the Huffman tree with optimal binary search tree.And we further present a method that use greedy algorithm to construct binary search tree and use C++ to realize method.Experimental provides some conclusions that greedy algorithm is more efficiency than dynamic programming algorithm.

Key concepts: Optimal binary search tree, Huffman coding, Self-balancing binary search tree, Binary tree, Computer science, Greedy algorithm, Ternary search tree, Binary search tree

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Construct Optimal Binary Search Tree by Using Greedy Algorithm — Research Paper | ScholarLens