"The Expected Performance of Traversal Algorithms in Binary Trees."

Keith Brinck (1985)

> Home

Details and statistics

DOI: 10.1093/COMJNL/28.4.426

access: closed

type: Journal Article

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cj/Brinck85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cj/Brinck85
Keith Brinck:
The Expected Performance of Traversal Algorithms in Binary Trees. Comput. J. 28(4): 426-432 (1985)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.