 The interval is supposed to contain the true value of that node.If all intervals attached to leaf nodes satisfy this property, then B* will identify an optimal path to the goal state.To back up the intervals within the tree, a parent's upper bound is set to the maximum of the upper bounds of the children.