Constructing a binary tree from its traversals by reversible recursion and iteration (Q2414043)
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 7053445
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing a binary tree from its traversals by reversible recursion and iteration |
scientific article; zbMATH DE number 7053445 |
Statements
Constructing a binary tree from its traversals by reversible recursion and iteration (English)
0 references
10 May 2019
0 references
binary tree
0 references
tree traversal
0 references
reversible algorithms
0 references
design of algorithms
0 references
program inversion
0 references
0.9324039
0 references
0.9158043
0 references
0.89764297
0 references
0.89164895
0 references
0.8860074
0 references
0.86629415
0 references
0.86624867
0 references
0.8611202
0 references
0.8589966
0 references
