The branching node deletion and conversion algorithm currently utilizes queue and recursion to be able to handle the deletion of arbitrarily-nested branching path. But it doesn't seem to be good enough at the moment because it cannot handle more than 3 nested branching paths.
Upon retrospective, I think the queue part isn't needed (could be wrong), recursion with loop alone is enough to handle this case.
The branching node deletion and conversion algorithm currently utilizes queue and recursion to be able to handle the deletion of arbitrarily-nested branching path. But it doesn't seem to be good enough at the moment because it cannot handle more than 3 nested branching paths.
Upon retrospective, I think the queue part isn't needed (could be wrong), recursion with loop alone is enough to handle this case.