👉 In the context of computer science, a wardable state in a data structure is a particular state that can be propagated to other states. A wardable state is one which cannot be reached from another state by performing any action on it. For example, consider a binary tree where each node has two children (left child and right child). If we want to reach the root of the tree, we need to visit every node in the tree. However, if we only have a single wardable state
