Heap Adjustment Algorithms Based on Complete Binary Tree Structure

Yuan Hu

doi:10.4028/www.scientific.net/AMM.321-324.2122

Paper Titles

The Automatic Algorithm of Cause and Effect of Finace Information Systems Based on Management Capabilities
p.2101

The Automatic Algorithm of Filling Hole Based-Mesh Panel Information Based-System Management
p.2106

Multi-Objective Optimization of Multi-Mixed-Model Assembly Lines Sequencing Problem
p.2110

An Ant Colony Optimization Algorithm for the Press Shop Scheduling Problem
p.2116

Heap Adjustment Algorithms Based on Complete Binary Tree Structure
p.2122

Gauss Pseudospectral Transcription for Trajectory Optimization of Lunar Impactor
p.2128

A Genetic Algorithm for the Production Policy in a Supply Chain under Discrete Demand and Time-Vary Cost
p.2137

Embedded Differential Evolution Algorithm for Recurrent Fuzzy Neural Network Controller Optimization
p.2141

Rough Set Fuzzy Neural Network Fault Diagnosis for the over Current Detection of Coal Mining Scraper
p.2146

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 321-324Heap Adjustment Algorithms Based on Complete...

Heap Adjustment Algorithms Based on Complete Binary Tree Structure

Abstract:

In many applications, it is necessary to adjust the node position of complete binary tree, making the data set have the nature of heap. Because when binary tree node data volume is huge, it will be needed apparently for heap adjustment efficiency of repair algorithms which is based on heap linear list to be improved. Now an improved algorithm is proposed by experiments, which utilizes characteristics of priority queue (delete the earliest data) and stack (delete the latest data), and conducts stack pushing on binary tree node, then accesses node successively to call glide adjustment algorithm to improve the adjustment efficiency.