leetcode_Kth Smallest Element in a BST

最新推荐文章于 2022-02-18 09:14:48 发布

mnmlist_tata

最新推荐文章于 2022-02-18 09:14:48 发布

阅读量540

点赞数

分类专栏： leetcode Java leetcode题解

本文链接：https://blog.csdn.net/mnmlist/article/details/47333679

版权

leetcode 同时被 3 个专栏收录

160 篇文章 0 订阅

订阅专栏

leetcode题解

141 篇文章 4 订阅

订阅专栏

Java

132 篇文章 1 订阅

订阅专栏

描述：

Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.
Note:
You may assume k is always valid, 1 ≤ k ≤ BST's total elements.
Follow up:
What if the BST is modified (insert/delete operations) often and you need to find the kth smallest frequently? How would you optimize the kthSmallest routine?
Hint:
Try to utilize the property of a BST.Show More Hint

思路：

1.一般涉及到树的问题用树的遍历方式来解决的可能性比较大，或者就是递归了

2.对于本题，一种很朴素的解决方式就是不是二叉查找树么，中序遍历时不就是一个有序的序列么，直接上中序遍历，遍历到第K个数即是本题要求的Kth Smallest Element in a BST

代码：

public int kthSmallest(TreeNode root, int k) {
		 int count=0;
	     Stack<TreeNode>st=new Stack<TreeNode>();
	     st.push(root);
	     TreeNode top=null;
	     while(!st.empty())
	     {
	    	 top=st.peek();
	    	 while(top.left!=null)
	    	 {
	    		 st.push(top.left);
	    		 top=top.left;
	    	 }
	    	 while(top.right==null)
	    	 {
	    		 count++;
	    		 if(count==k)
	    		    return top.val;
	    		 st.pop();
	    		 if(!st.empty())
	    			 top=st.peek();
	    		 else
	    			 break;
	    	 }
	    	 if(!st.empty())
	    	 {
	    		 count++;
	    		 if(count==k)
	    		    return top.val;
		    	 st.pop();
		    	 st.push(top.right);
	    	 }
	    	 
	     }
	     return -1;
    }