> For the complete documentation index, see [llms.txt](https://algorithm.prettylog.com/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/find-successor.md).

# Find Successor

![](/files/qMuF65Bm6ZqEnCSLOtfN)

* n, n

```jsx
// This is an input class. Do not edit.
class BinaryTree {
  constructor(value) {
    this.value = value;
    this.left = null;
    this.right = null;
    this.parent = null;
  }
}

function findSuccessor(tree, node) {
  const arr = [];
  traverseHelper(tree, node, arr);
  // console.log(arr, node.value);
  for (let i = 0; i < arr.length; i++) {
    if (arr[i].value !== node.value) continue;
    return arr[i + 1];
  }
  
  return null;
}

function traverseHelper(tree, node, arr) {
  if (tree === null) {
    return;
  }
  traverseHelper(tree.left, node, arr);
  arr.push(tree);
  traverseHelper(tree.right, node, arr);
  return;
}

// Do not edit the lines below.
exports.BinaryTree = BinaryTree;
exports.findSuccessor = findSuccessor;
```

* h, 1 ( left node or parent node of right)

```jsx
// This is an input class. Do not edit.
class BinaryTree {
  constructor(value) {
    this.value = value;
    this.left = null;
    this.right = null;
    this.parent = null;
  }
}

function findSuccessor(tree, node) {
  return find(tree, node);
}

function find(node, target) {

  // check if target has right node;
  if (target.right !== null) {
    // has right then right itself or left most
    let currentNode = target.right;
    while (currentNode.left !== null) {
      currentNode = currentNode.left;
    }
    // has no left? target.right
    // has left? left -> left(this) -> null
    return currentNode;
  }

  // if target has no right
  // then need to check parent
  let currentNode = target;
  while (currentNode.parent !== null) {
    // if currentNode.parent.left === currnetNode
    // its next node to visit is currentNode.parent, and it is a successor
    if (currentNode.parent.left === currentNode) {
      return currentNode.parent;
    }

    currentNode = currentNode.parent;
  }

  return currentNode.parent;
}

// Do not edit the lines below.
exports.BinaryTree = BinaryTree;
exports.findSuccessor = findSuccessor;
```


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter:

```
GET https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/find-successor.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.