nextLeft method

Node? nextLeft(
  1. Graph graph,
  2. Node? node
)

Implementation

Node? nextLeft(Graph graph, Node? node) {
  return hasSuccessor(node)
      ? getLeftMostChild(graph, node)
      : getNodeData(node)?.thread;
}