Start at the root of the BST.
Traverse left until you find a node that does not have a left child.
The value at this node is the minimum value in the BST.
Code

[{"language":"Java","code":"class Solution {\n   public int findMaximum(TreeNode root) {\n       if (root == null) {\n           throw new IllegalArgumentException(\"Tree is empty\");\n       }\n\n       // Iterative traversal to the right-most node\n       TreeNode current = root;\n       while (current.right != null) {\n           current = current.right;\n       }\n\n       return current.val; // Maximum value is in the right-most node\n   }\n\n   public static void main(String[] args) {\n       // Example: Create a BST and find the maximum value\n       Solution solution = new Solution();\n       TreeNode root = new TreeNode(40);\n       root.left = new TreeNode(30);\n       root.right = new TreeNode(50);\n       root.right.left = new TreeNode(45);\n       root.right.right = new TreeNode(60);\n\n       int maxValue = solution.findMaximum(root);\n       System.out.println(\"Maximum value: \" + maxValue); // Output: 60\n   }\n}","lang":"java","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">class</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> Solution</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> {</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">   public</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> int</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> findMaximum</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(TreeNode </span><span style=\"color:#E36209;--shiki-dark:#FFAB70\">root</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">) {</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">       if</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> (root </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">==</span><span style=\"color:#005CC5;--shiki-dark:#79B8FF\"> null</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">) {</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">           throw</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> new</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> IllegalArgumentException</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(</span><span style=\"color:#032F62;--shiki-dark:#9ECBFF\">\"Tree is empty\"</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">);</span></span>\n<span class=\"line\"><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">       }</span></span>\n<span class=\"line\"></span>\n<span class=\"line\"><span style=\"color:#6A737D;--shiki-dark:#6A737D\">       // Iterative traversal to the right-most node</span></span>\n<span class=\"line\"><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">       TreeNode current </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">=</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> root;</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">       while</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> (current.right </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">!=</span><span style=\"color:#005CC5;--shiki-dark:#79B8FF\"> null</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">) {</span></span>\n<span class=\"
Related Tags
