Describe Behavior Tree

What a behaviour tree is made of and, more usefully, every blackboard key it references and whether each one still resolves. A node holds a key by NAME, so a renamed or deleted key breaks the reference with no compile error and no reference viewer entry; at runtime the decorator built on it evaluates as false rather than failing, and the branch it guards simply never runs.