Binary Tree in Java 8

Binary Tree in Java 8 :

Map<Integer, String> myMap = new HashMap<Integer, String>();
List<String> myList = new ArrayList<String>();
Object temp;

for (Object obj : objList) {
temp = obj;
while (temp.getParentId() != defaultId) {
myList.add(temp.getName().replaceAll(REGEX, HYPHEN).toLowerCase());
for (Object o : objList) {
if (o.getId() == temp.getParentId()) {
temp = o;
break;
}
}
}
myList.add(temp.getName().replaceAll(REGEX, HYPHEN).toLowerCase());
if (myList.size() == 0) {
myMap.put(obj.getId(), myList.get(0));
} else {
Collections.reverse(myList);
String url = myList.stream().collect(Collectors.joining(SLASH));
myMap.put(obj.getId(), url);
}
myList.clear();
}