LeetCode - Algorithms - 700. Search in a Binary Search Tree

Problem

700. Search in a Binary Search Tree

Java

Recursion

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
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    private TreeNode recur(TreeNode node, int val) {
        if (node.val == val)
            return node;
        else if (val < node.val) {
            if (node.left == null)
                return null;
            else
                return recur(node.left, val);
        } else {
            if (node.right == null)
                return null;
            else
                return recur(node.right, val);
        }
    }
    
    public TreeNode searchBST(TreeNode root, int val) {
        return recur(root, val);
    }
}

Submission Detail

  • 36 / 36 test cases passed.
  • Runtime: 0 ms, faster than 100.00% of Java online submissions for Search in a Binary Search Tree.
  • Memory Usage: 39.7 MB, less than 16.71% of Java online submissions for Search in a Binary Search Tree.