<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def _adds_dels_sucpred(self, cache, branch, turn, tick, *, stoptime=None):
 """Take the successors or predecessors cache and get nodes added or deleted from it Operates like ``_get_adds_dels``. """

        added = set()
        deleted = set()
        for node, nodes in cache.items():
            addidx, delidx = self._get_adds_dels(nodes, branch, turn, tick, stoptime=stoptime)
            if addidx and not delidx:
                added.add(node)
            elif delidx and not addidx:
                deleted.add(node)
        return added, deleted