Codeless Data Structures and Algorithms

Subero, A. (2020). Codeless Data Structures and Algorithms. Apress.

Type

Book chapter

Intellectual base

Review or monograph

Year

2020

DOI

10.1007/978-1-4842-5725-8

Link

https://doi.org/10.1007/978-1-4842-5725-8

Cited by

1 citation across 1 artifact.

Domain-specific

• Tree (abstract data type)
  • A rooted tree is connected and acyclic, supports traversal and subtree operations and admits ordered, binary, search, balanced and persistent variants whose additional invariants must be stated separately.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:37f8225ad42c · see in the full table