z-logo
open-access-imgOpen Access
Short Note: A Note on the Expected Behaviour of Binary Tree Traversals
Author(s) -
Arne Andersson
Publication year - 1990
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/33.5.471
Subject(s) - preorder , tree traversal , stack (abstract data type) , pointer (user interface) , computer science , binary tree , graph traversal , binary number , tree (set theory) , call stack , algorithm , parallel computing , theoretical computer science , programming language , mathematics , discrete mathematics , arithmetic , combinatorics , artificial intelligence

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom