An Amortized Analysis of Insertions into AVL-Trees

DOI10.1137/0215002zbMATH Open0589.68048OpenAlexW2021573024MaRDI QIDQ3718166FDOQ3718166

Authors: K. Mehlhorn, Athanasios K. Tsakalidis 

Publication date: 1986

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0215002

Recommendations

• Amortized Complexity of Bulk Updates in AVL-Trees
• scientific article; zbMATH DE number 2050880
• Expected behaviour analysis of AVL trees
• Improved bounds for the expected behaviour of AVL trees
• Rank-Balanced Trees

zbMATH Keywords

random insertionsbalanced search treesamortized behavior of AVL-trees under sequences of insertionsbalance changes

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cited In (16)

• Exponentially decreasing number of operations in balanced trees
• Relaxed multi-way trees with group updates.
• Modeling B-tree insertion activity
• Some Results for Elementary Operations
• On the existence and construction of non-extreme \((a,b)\)-trees.
• Title not available (Why is that?)
• Title not available (Why is that?)
• An O(\(n\)) time algorithm for maximum matching on cographs
• Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees
• Expected behaviour analysis of AVL trees
• Title not available (Why is that?)
• Average-case analysis of quicksort and binary insertion tree height using incompressibility
• AVL trees with relaxed balance
• Improved bounds for the expected behaviour of AVL trees
• Preprocessing Ambiguous Imprecise Points
• Amortized Complexity of Bulk Updates in AVL-Trees

This page was built for publication: An Amortized Analysis of Insertions into AVL-Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3718166)