The node visit cost of brother trees
type: Item
instance of: scholarly article
title: The node visit cost of brother trees
zbMATH Open document ID: 0636.68077
DOI: 10.1016/0890-5401(87)90053-8
author: Rolf Klein
author: D. Wood
published in: Information and Computation
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4037230
zbMATH Keywords: brother search tree
zbMATH Keywords: node visit cost
MaRDI profile type: Publication
full work available at URL: 0890-5401(87)90053-8
OpenAlex ID: W1556080432
cites work: Axioms and hulls
cites work: Q3219751
cites work: Binary Search Trees of Bounded Balance
cites work: Minimal-Cost Brother Trees
cites work: Q4096430
cites work: On the correspondence between AVL trees and brother trees
cites work: Right brother trees
cites work: 1-2 Brother Trees or AVL Trees Revisited
Recommended article: Q3785961
Recommended article: Balance in AVL trees and space cost of brother trees
Recommended article: Minimal-Cost Brother Trees
Recommended article: Q4524566
Recommended article: Q3335001
Recommended article: Search cost for a nearly optimal path in a binary tree
Recommended article: Q4887691
Recommended article: Expected Costs in Some Classes of Binary Search Trees
Recommended article: Q4437486
Recommended article: Q3469112
description: scientific article; zbMATH DE number 4037230