https://blog.youkuaiyun.com/XIAOHAIYOUzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135890615https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135890615XIAOHAIYOUSat, 27 Jan 2024 23:59:00 +0800https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135800099https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135800099XIAOHAIYOUWed, 24 Jan 2024 00:22:40 +0800https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135760591https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135760591XIAOHAIYOUMon, 22 Jan 2024 23:22:07 +0800https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135737503https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135737503XIAOHAIYOUSun, 21 Jan 2024 23:12:36 +0800https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135734905https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135734905XIAOHAIYOUSun, 21 Jan 2024 20:47:24 +0800https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135444255https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135444255XIAOHAIYOUSun, 07 Jan 2024 20:22:44 +0800=L) 。你可能需要改变树的根节点，所以结果应当返回修剪好的二叉搜索树的新的根节点。确定递归函数的参数以及返回值这里我们为什么需要返回值呢？因为是要遍历整棵树，做修改，其实不需要返回值也可以，我们也可以完成修剪（其实就是从二叉树中移除节点）的操作。但是有返回值，更方便，可以通过递归函数的返回值来移除节点。代码如下： TreeNode* trimBST(TreeNode* root,]]>https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135432371https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135432371XIAOHAIYOUSat, 06 Jan 2024 21:25:07 +0800https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135380797https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135380797XIAOHAIYOUThu, 04 Jan 2024 10:41:51 +0800https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135355798https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135355798XIAOHAIYOUWed, 03 Jan 2024 09:42:11 +0800https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135344790https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135344790XIAOHAIYOUTue, 02 Jan 2024 16:51:51 +0800https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135233479https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135233479XIAOHAIYOUTue, 26 Dec 2023 23:19:54 +0800https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135210455https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135210455XIAOHAIYOUMon, 25 Dec 2023 22:24:58 +0800https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135188730https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135188730XIAOHAIYOUSun, 24 Dec 2023 23:08:37 +0800right) { // 当左右孩子都为空的时候，说明是最低点的一层了，退出。// 这里一定要使用固定大小size，不要使用que.size()，因为que.size是不断变化的。本题依然是层序遍历，只不过在单层遍历的时候记录一下本层的头部节点，然后在遍历的时候让前一个节点指向本节点就可以了。]]>https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135177628https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/135177628XIAOHAIYOUSun, 24 Dec 2023 02:07:00 +0800https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/134938490https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/134938490XIAOHAIYOUMon, 11 Dec 2023 23:07:06 +0800i++) {​// 对频率排序// 定义一个小顶堆，大小为k​// 用固定大小为k的小顶堆，扫面所有频率的数值it!it++) {]]>https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/134916546https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/134916546XIAOHAIYOUSun, 10 Dec 2023 23:05:13 +0800https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/134901409https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/134901409XIAOHAIYOUSat, 09 Dec 2023 21:42:52 +0800https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/134864764https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/134864764XIAOHAIYOUThu, 07 Dec 2023 20:52:46 +0800https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/134847724https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/134847724XIAOHAIYOUThu, 07 Dec 2023 09:52:44 +0800https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/134843926https://blog.youkuaiyun.com/XIAOHAIYOU/article/details/134843926XIAOHAIYOUWed, 06 Dec 2023 23:48:18 +0800