Computing parent nodes in threaded binary trees

DOI10.1007/BF01935047zbMath0621.68027MaRDI QIDQ1090107

Keith Brinck

Publication date: 1986

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

analysis of algorithmsdata structuresrecurrence relationsbinary treesaverage case complexityworst case complexityparent of a nodethreaded binary tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• The Expected Performance of Traversal Algorithms in Binary Trees
• On deletion in threaded binary trees
• Analysis of algorithms on threaded trees

This page was built for publication: Computing parent nodes in threaded binary trees