xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-13 04:10:58 +00: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
codes/go/chapter_tree/binary_search_tree.go
+4 -17
View File
@@ -23,13 +23,13 @@ func NewBinarySearchTree(nums []int) *BinarySearchTree {
}
}
// GetRoot Get the root node of binary search tree
/* 获取根结点 */
func (bst *BinarySearchTree) GetRoot() *TreeNode {
return bst.root
}
// GetMin Get node with the min value
func (bst *BinarySearchTree) GetMin(node *TreeNode) *TreeNode {
/* 获取中序遍历的下一个结点 */
func (bst *BinarySearchTree) GetInOrderNext(node *TreeNode) *TreeNode {
if node == nil {
return node
}
@@ -40,19 +40,6 @@ func (bst *BinarySearchTree) GetMin(node *TreeNode) *TreeNode {
return node
}
// GetInorderNext Get node inorder next
func (bst *BinarySearchTree) GetInorderNext(node *TreeNode) *TreeNode {
if node == nil || node.Right == nil {
return node
}
node = node.Right
// 循环访问左子结点，直到叶结点时为最小结点，跳出
for node.Left != nil {
node = node.Left
}
return node
}
/* 查找结点 */
func (bst *BinarySearchTree) Search(num int) *TreeNode {
node := bst.root
@@ -149,7 +136,7 @@ func (bst *BinarySearchTree) Remove(num int) *TreeNode {
// 子结点数为 2
} else {
// 获取中序遍历中待删除结点 cur 的下一个结点
next := bst.GetInorderNext(cur)
next := bst.GetInOrderNext(cur)
temp := next.Val
// 递归删除结点 next
bst.Remove(next.Val)