《LeetCode力扣练习》代码随想录——二叉树(二叉搜索树中的搜索—Java)
刷题思路来源于 代码随想录
700. 二叉搜索树中的搜索
-
迭代遍历
/** * 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 { public TreeNode searchBST(TreeNode root, int val) { while (root != null) { if (val < root.val) { root = root.left; } else if (val > root.val) { root = root.right; } else { return root; } } return null; } }