Searched refs:rightChild (Results 1 – 6 of 6) sorted by relevance
52 public abstract Optional<T> rightChild(T root); in rightChild() method in BinaryTreeTraverser78 Optional<T> right = rightChild(root); in children()115 pushIfPresent(stack, rightChild(result));160 pushIfPresent(stack, rightChild(node));196 pushIfPresent(stack, rightChild(node));
45 public abstract Optional<T> rightChild(T root); in rightChild() method in BinaryTreeTraverser71 Optional<T> right = rightChild(root); in children()119 pushIfPresent(rightChild(inOrderNode.node));
105 Optional<BinaryNode> rightChild = createTreap(keys.subList(minIndex + 1, keys.size())); in createTreap() local106 return Optional.of(new BinaryNode(keys.get(minIndex), leftChild, rightChild)); in createTreap()122 public Optional<BinaryNode> rightChild(BinaryNode node) {
142 int rightChild = leftChild + 1; in next() local146 if (rightChild < fTileCnt) { in next()147 fScheduleData[rightChild].fSemaphore.signal(); in next()
76 public Optional<BinaryTree> rightChild(BinaryTree node) {
78 public Optional<BinaryTree> rightChild(BinaryTree node) {