A note on the reconstruction of a binary tree from its traversals (Q1198039)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 92103
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the reconstruction of a binary tree from its traversals |
scientific article; zbMATH DE number 92103 |
Statements
A note on the reconstruction of a binary tree from its traversals (English)
0 references
16 January 1993
0 references
analysis of algorithms
0 references
tree traversal
0 references
linear-time sequential algorithm
0 references
binary tree
0 references
preorder and inorder traversals
0 references
parallel algorithm
0 references
EREW PRAM model
0 references
0.9050278067588806
0 references
0.8960551619529724
0 references
0.8870004415512085
0 references
0.8751094341278076
0 references
0.8718156814575195
0 references
