-
Notifications
You must be signed in to change notification settings - Fork 2
/
search-in-a-binary-search-tree.rs
46 lines (39 loc) · 1.01 KB
/
search-in-a-binary-search-tree.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
#![allow(dead_code, unused, unused_variables)]
fn main() {}
struct Solution;
// Definition for a binary tree node.
#[derive(Debug, PartialEq, Eq)]
pub struct TreeNode {
pub val: i32,
pub left: Option<Rc<RefCell<TreeNode>>>,
pub right: Option<Rc<RefCell<TreeNode>>>,
}
impl TreeNode {
#[inline]
pub fn new(val: i32) -> Self {
TreeNode {
val,
left: None,
right: None,
}
}
}
use std::cell::RefCell;
use std::rc::Rc;
impl Solution {
pub fn search_bst(
root: Option<Rc<RefCell<TreeNode>>>,
val: i32,
) -> Option<Rc<RefCell<TreeNode>>> {
let mut root = root;
while let Some(r) = root {
let v = r.borrow().val;
match v.cmp(&val) {
std::cmp::Ordering::Equal => return Some(r),
std::cmp::Ordering::Greater => root = r.borrow_mut().left.take(),
std::cmp::Ordering::Less => root = r.borrow_mut().right.take(),
}
}
None
}
}