Search:

I am getting stack overflow error in move. Also some conditions is wrong.Can someone help me with algorithm here?

I want to print it

Elie
-------2
-----------4
-------3
-----------1
-----------------2
krikor
--------elie

package project2;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;

public class Exercise {
String krikor = "lolig";

public Exercise() {

case works like this

1/2/3
2/3/4
1/6/7

tree willlook

1
---2

paths = [
"nodeA1",
"nodeA1/nodeB1/nodeC1",
"nodeA1/nodeB1/nodeC1/nodeD1/nodeE1",
"nodeA1/nodeB1/nodeC2",
"nodeA1/nodeB2/nodeC2",
"nodeA3/nodeB2/nodeC3"
]

paths = [
"nodeA1",
"nodeA1/nodeB1/nodeC1",
"nodeA1/nodeB1/nodeC1/nodeD1/nodeE1",
"nodeA1/nodeB1/nodeC2",
"nodeA1/nodeB2/nodeC2",
"nodeA3/nodeB2/nodeC3"
]