力扣第二十四天(Tree topic)

NP_hard

于 2022-02-09 13:52:18 发布

阅读量321

点赞数

分类专栏： LeetCode Learning 文章标签： leetcode 算法深度优先

本文链接：https://blog.csdn.net/NP_hard/article/details/122839885

版权

LeetCode Learning 专栏收录该内容

60 篇文章 0 订阅

订阅专栏

本文探讨了如何在二叉搜索树中使用递归和迭代方法找到第k小的元素，以及实现BST迭代器进行中序遍历。两种方法的时间复杂度均为O(n)，但空间复杂性不同。同时介绍了BinarySearchTreeIterator类的实现，适用于在BST中高效地获取按顺序的第k个节点。

摘要由CSDN通过智能技术生成

文章目录

problem Ⅰ
- solution 1 `recursive` `inorder-traversal`
- solution 2 `iterative (use stack)` `inorder-traversal`
problem 2
- solution

problem Ⅰ

230. Kth Smallest Element in a BST
Given the root of a binary search tree, and an integer k, return the kth smallest value (1-indexed) of all the values of the nodes in the tree.

Example 1:
在这里插入图片描述

Input: root = [3,1,4,null,2], k = 1
Output: 1

Example 2:
在这里插入图片描述

Input: root = [5,3,6,2,4,null,null,1], k = 3
Output: 3

solution 1 `recursive` `inorder-traversal`

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int ans = 0;
    int cnt = 0;
    int kthSmallest(TreeNode* root, int k) {
        if(!root)return ans;
        kthSmallest(root->left, k);
        ++cnt;
        if(cnt==k)
            ans = root->val;
        if(!ans)// if ans has been found, we needn't find the right part
            kthSmallest(root->right, k);
        return ans;
    }
};

在这里插入图片描述

time complexity : $O (n)$
space complexity : $O (1)$

solution 2 `iterative (use stack)` `inorder-traversal`

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int kthSmallest(TreeNode* root, int k) {
        stack<TreeNode*> stk;
        while(true){
            while(root){
                stk.push(root);
                root = root->left;
            }
            root = stk.top();
            if(--k==0)return root->val;
            stk.pop();
            root = root->right;
        }
    }
};

在这里插入图片描述

time complexity : $O (n)$
space complexity : $O (n)$

problem 2

173. Binary Search Tree Iterator
Implement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST):

BSTIterator(TreeNode root) Initializes an object of the BSTIterator class. The root of the BST is given as part of the constructor. The pointer should be initialized to a non-existent number smaller than any element in the BST.
boolean hasNext() Returns true if there exists a number in the traversal to the right of the pointer, otherwise returns false.
int next() Moves the pointer to the right, then returns the number at the pointer.
Notice that by initializing the pointer to a non-existent smallest number, the first call to next() will return the smallest element in the BST.

You may assume that next() calls will always be valid. That is, there will be at least a next number in the in-order traversal when next() is called.

Example 1:

在这里插入图片描述

Input
["BSTIterator", "next", "next", "hasNext", "next", "hasNext", "next", "hasNext", "next", "hasNext"]
[[[7, 3, 15, null, null, 9, 20]], [], [], [], [], [], [], [], [], []]
Output
[null, 3, 7, true, 9, true, 15, true, 20, false]

Explanation
BSTIterator bSTIterator = new BSTIterator([7, 3, 15, null, null, 9, 20]);
bSTIterator.next();    // return 3
bSTIterator.next();    // return 7
bSTIterator.hasNext(); // return True
bSTIterator.next();    // return 9
bSTIterator.hasNext(); // return True
bSTIterator.next();    // return 15
bSTIterator.hasNext(); // return True
bSTIterator.next();    // return 20
bSTIterator.hasNext(); // return False

solution

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class BSTIterator {
public:
    
    stack<TreeNode*> stk;
    void partInorder(TreeNode* root){
        while(root){
            stk.push(root);
            root = root->left;
        }
    }
    
    BSTIterator(TreeNode* root) {
        partInorder(root);
    }
    
    int next() {
        TreeNode* node = stk.top();
        stk.pop();
        partInorder(node->right);
        return node->val;
    }
    
    bool hasNext() {
        return !stk.empty();
    }
};

/**
 * Your BSTIterator object will be instantiated and called as such:
 * BSTIterator* obj = new BSTIterator(root);
 * int param_1 = obj->next();
 * bool param_2 = obj->hasNext();
 */