Yes, because the set of binary tree shapes is a countable set.  There are a finite number of binary tree shapes of a given depth, and the union of a countable number of finite sets is a countable set.
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence