Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6376 |

@mb1973 | 5594 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3412 |

Complete Leaderboard | |

Handle | Score |

@codersgroup18 | 783 |

@Manikanta punnam | 605 |

@sriramgoparaju99 | 578 |

@rdakka | 530 |

@praveenbgp6 | 529 |

@prankursharma31 | 518 |

@yashkaril4 | 517 |

@purohitmn02 | 467 |

@sonamnigam1999 | 443 |

@sonamkumari63928 | 441 |

@shubhamstudent5 | 433 |

Complete Leaderboard |

Given a BST, and a reference to a Node x in the BST. Find the Inorder Successor of the given node in the BST.

**Example 1:**

**Input:
2**
/ \
** **1 3
K(data of x) = 2
**Output: **3
**Explanation:**
Inorder traversal : 1 2 3
Hence, inorder successor of 2 is 3.

**Example 2:**

**Input:
**** ** 20
/ \
8** **22
/ \
4 12
/** **\
10 14
K(data of x) = 8
**Output: **10**
Explanation:
**Inorder traversal: 4 8 10 12 14 20 22
Hence, successor of 8 is 10.

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **inOrderSuccessor()**. This function takes the root node and the reference node as argument and returns the node that is inOrder successor of the reference node. If there is no successor, return null value.

**Expected Time Complexity:** O(Height of the BST).

**Expected Auxiliary Space:** O(1).

**Constraints:**

1 <= N <= 1000, where N is number of nodes

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Inorder Successor in BST

...