algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

Free memory after removing

Browse Source 
a node from a LinkedList or TreeNode.
This commit is contained in:
Yudong Jin
2023-01-02 19:53:55 +08:00
parent 6b02449f22
commit 410c5d6b62
20 changed files with 69 additions and 140 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
codes/java/chapter_tree/avl_tree.java
View File

@ -138,7 +138,7 @@ class AVLTree {
node = child;
} else {
// 子结点数量 = 2 ，则将中序遍历的下个结点删除，并用该结点替换当前结点
TreeNode temp = minNode(node.right);
TreeNode temp = getInOrderNext(node.right);
node.right = removeHelper(node.right, temp.val);
node.val = temp.val;
}
@ -150,8 +150,8 @@ class AVLTree {
return node;
}
/* 获取最小结点 */
private TreeNode minNode(TreeNode node) {
/* 获取中序遍历中的下一个结点（仅适用于 root 有左子结点的情况） */
private TreeNode getInOrderNext(TreeNode node) {
if (node == null) return node;
// 循环访问左子结点，直到叶结点时为最小结点，跳出
while (node.left != null) {

6
codes/java/chapter_tree/binary_search_tree.java
View File

@ -101,7 +101,7 @@ class BinarySearchTree {
// 子结点数量 = 2
else {
// 获取中序遍历中 cur 的下一个结点
TreeNode nex = min(cur.right);
TreeNode nex = getInOrderNext(cur.right);
int tmp = nex.val;
// 递归删除结点 nex
remove(nex.val);
@ -111,8 +111,8 @@ class BinarySearchTree {
return cur;
}
/* 获取最小结点 */
public TreeNode min(TreeNode root) {
/* 获取中序遍历中的下一个结点（仅适用于 root 有左子结点的情况） */
public TreeNode getInOrderNext(TreeNode root) {
if (root == null) return root;
// 循环访问左子结点，直到叶结点时为最小结点，跳出
while (root.left != null) {