 deepest child!" << endl; #endif                                                          // We are a new second deepest child.                             parent_record.second_deepest_child_edge = frame.here;                         }                     }                                          // The length of the longest leaf-leaf path converging at or under 