Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An optimal algorithm for reconstructing a binary tree

From MaRDI portal
Publication:1198037
Jump to:navigation, search

DOI10.1016/0020-0190(92)90099-HzbMath0780.68061MaRDI QIDQ1198037

C. Pandu Rangan, V. Kamakoti

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)


zbMATH Keywords

binary treeanalysis of algorithmsparallel algorithmtree traversalEREW PRAM modelinorder and predorder traversals


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Distributed algorithms (68W15)


Related Items (2)

New algorithms for the LCA problem and the binary tree reconstruction problem ⋮ Optimal binary search trees




Cites Work

  • Unnamed Item
  • Construction of a tree from its traversals in optimal time and space
  • Two algorithms for constructing a binary tree from its traversals
  • Constructing a binary tree from its traversals




This page was built for publication: An optimal algorithm for reconstructing a binary tree

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1198037&oldid=13258791"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 05:48.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki