Properties of Binary Trees Related to Position

DOI10.1093/COMJNL/35.4.395MaRDI QIDQ4019941zbMATH OpenOpenAlexFDO

Authors Renzo Sprugnoli

Publication date 16 January 1993

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/35.4.395

zbMATH Keywords

binary treesleaf analysispermutation treesroot analysis

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Counting labels in binary trees
• scientific article; zbMATH DE number 4023312
• scientific article; zbMATH DE number 892276
• Moments of level numbers of leaves in binary trees
• The Variance of Level Numbers in Certain Families of Trees

Cited in

(6)

• Postorder trees and Eulerian numbers
• Average-case analysis of priority trees: A structure of priority queue administration
• scientific article; zbMATH DE number 892276 (Why is no real title available?)
• Average case analysis of leaf-centric binary tree sources
• Binary search trees, recurrent properties and wave equations
• Deux propriétés des arbres binaires ordonnés stricts. (Two properties of strictly ordered binary trees)

This page was built for publication: Properties of Binary Trees Related to Position

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