给定一棵二叉搜索树, 请找出其中的第k小的结点.思路: 按照中序遍历找.class TreeNode1 { int val = 0; TreeNode1 left = null; TreeNode1 right = null; public TreeNode1(int val) { this.val = val; }}public class DemoB { TreeNode1 KthNode(TreeNode1 pRoot, in
Other
2024-05-15
142 点赞
2 评论
215 浏览
