Searched refs:leftChild (Results 1 – 6 of 6) sorted by relevance
46 public abstract Optional<T> leftChild(T root); in leftChild() method in BinaryTreeTraverser71 Optional<T> left = leftChild(root); in children()116 pushIfPresent(stack, leftChild(result));161 pushIfPresent(stack, leftChild(node));200 pushIfPresent(stack, leftChild(node));
39 public abstract Optional<T> leftChild(T root); in leftChild() method in BinaryTreeTraverser64 Optional<T> left = leftChild(root); in children()123 pushIfPresent(leftChild(inOrderNode.node));
104 Optional<BinaryNode> leftChild = createTreap(keys.subList(0, minIndex)); in createTreap() local106 return Optional.of(new BinaryNode(keys.get(minIndex), leftChild, rightChild)); in createTreap()117 public Optional<BinaryNode> leftChild(BinaryNode node) {
141 int leftChild = (tileIndex + 1) * 2 - 1; in next() local142 int rightChild = leftChild + 1; in next()143 if (leftChild < fTileCnt) { in next()144 fScheduleData[leftChild].fSemaphore.signal(); in next()
71 public Optional<BinaryTree> leftChild(BinaryTree node) {
73 public Optional<BinaryTree> leftChild(BinaryTree node) {