Geeksforgeeks

Error

×

Leaderboard

Showing:

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

@Ibrahim Nash | 6420 |

@blackshadows | 6380 |

@mb1973 | 5642 |

@Quandray | 5233 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3413 |

Complete Leaderboard | |

Handle | Score |

@sanskar94511 | 533 |

@akashverma4 | 291 |

@swastik8750 | 237 |

@nishunishuraj18 | 223 |

@nayan2709 | 211 |

@ajaybhardwaj1999 | 196 |

@surajmamgai | 193 |

@AnshikaPandey | 192 |

@gurshehzadsingh | 188 |

@shardul08 | 185 |

@Rajpra786 | 181 |

Complete Leaderboard |

Given a **Binary Search Tree **and a node value X, find if node with value X is present in the BST or not.

**Example 1:**

**Input:
** 2
\
81
/ \
42 87
/ \ \
45 66 90
x = 87
**Output: **1**
Explanation: **As 87 is present in the
given nodes , so the output will be
1.

**Example 2:**

**Input:
** 6
\
7
/ \
8 9
x = 11
**Output: **0**
Explanation: **As 11 is not present in
he given nodes , so the output will
be 0.

**Your Task:**

You don't need to read input or print anything. Complete the function** search() **which returns **true **if the node with **value x** is **present **in the BST **else returns false**.

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

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

**Constraints:**

1 <= Number of nodes <= 10^{5}

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
Search a node in BST

...