Bottom-up Update Mechanism for Re-structured Complete Binary Trees

α
Mevlut Bulut
Mevlut Bulut
α University of Alabama at Birmingham University of Alabama at Birmingham

Send Message

To: Author

Bottom-up Update Mechanism for Re-structured Complete Binary Trees

Article Fingerprint

ReserarchID

CSTSDEJL4P1

Bottom-up Update Mechanism for Re-structured Complete Binary Trees Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

References

9 Cites in Article
  1. G Kirchhoff (1847). Ueber die auflösung der gleichungen auf welche man bei der untersuchung der linearen vertheilung galvanischer ströme geführt wird.
  2. S Sahni (2005). Structures, algorithms, and applications in C++.
  3. E Friend (1956). Sorting on electronic computer systems.
  4. Mauricio Marín,Patricio Cordero (1995). An empirical assessment of priority queues in event-driven molecular dynamics simulation.
  5. D Knuth (1998). The art of computer programming.
  6. M Marín (1997). An empirical comparison of priority queue algorithms.
  7. Xavier Martinez-Palau,David Dominguez-Sal,Josep Larriba-Pey (2010). Two-way replacement selection.
  8. M Bulut (2016). ReducedCBT and SuperCBT, two new and improved complete binary tree structures.
  9. J Kim,N Chhugani,E Sedlar,A Nguyen,T Kaldewey,V Lee,S Brandt,P Dubey (2010). FAST: fast architecture sensitive tree search on modern CPUs and GPUs.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Mevlut Bulut. 2016. \u201cBottom-up Update Mechanism for Re-structured Complete Binary Trees\u201d. Global Journal of Computer Science and Technology - C: Software & Data Engineering GJCST-C Volume 16 (GJCST Volume 16 Issue C3): .

Download Citation

Issue Cover
GJCST Volume 16 Issue C3
Pg. 11- 19
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-C Classification: I.1.2, I.2.2
Version of record

v1.2

Issue date

July 1, 2016

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 7159
Total Downloads: 1909
2026 Trends
Related Research

Published Article

Abstract not found

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Bottom-up Update Mechanism for Re-structured Complete Binary Trees

Mevlut Bulut
Mevlut Bulut University of Alabama at Birmingham

Research Journals