Tap here to switch tabs
Problem
Submissions

Problem: Inorder Successor in BST

Inorder Successor in BST gives you a binary search tree and a node p. Return the node with the smallest value greater than p, or NULL when p has no successor.

Statement

You are given the root node of a binary search tree and a specific node p. Your task is to return the inorder successor of this p node. If there is no inorder successor of the given node, return NULL.

Note: The inorder successor of p is the node with the smallest value greater than p.data in the binary search tree.

Constraints:

  • The tree contains nodes in the range [1,500][1,500].

  • −104≤-10^4 \leqNode.data ≤104\leq 10^4

  • All Nodes will have unique values.

  • p should exist in the tree.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Inorder Successor in BST

Inorder Successor in BST gives you a binary search tree and a node p. Return the node with the smallest value greater than p, or NULL when p has no successor.

Statement

You are given the root node of a binary search tree and a specific node p. Your task is to return the inorder successor of this p node. If there is no inorder successor of the given node, return NULL.

Note: The inorder successor of p is the node with the smallest value greater than p.data in the binary search tree.

Constraints:

  • The tree contains nodes in the range [1,500][1,500].

  • −104≤-10^4 \leqNode.data ≤104\leq 10^4

  • All Nodes will have unique values.

  • p should exist in the tree.