EQD5vYdLOjT-1rZYM3f1tPD2AuVn5JnWGaJfwIxnRtnfA9b3

{
  "name": "Disruptor #262",
  "image": "https://collection.disruptors.space/items/disruptor-262.png",
  "attributes": [
    {
      "trait_type": "background",
      "value": "back3_(purple)"
    },
    {
      "trait_type": "body",
      "value": "body_red"
    },
    {
      "trait_type": "face",
      "value": "tunnel_cyan"
    },
    {
      "trait_type": "neck",
      "value": "neck_vet_(red)"
    },
    {
      "trait_type": "hats",
      "value": "long_hair_(yellow)"
    }
  ],
  "description": "If there are N leaves in the tree (i.e., our hashmap contains N values), then there are exactly N − 1 intermediate vertices."
}