Armstrong databases are a popular tool in example-based database design. An Armstrong database for a given constraint set ∑ from a fixed constraint class satisfies precisely those constraints from that are logically implied by ∑. In this paper we study Armstrong data trees for functional dependencies for XML-encoded data in the context of a simple XML tree model reflecting the permitted parent-child relationships together with their frequencies