Commit 66947ee

authored

Merge pull request youngyangyang04#2821 from gazeldx/P0450

0450.删除二叉搜索树中的节点加入Ruby递归实现

2 parents 656ea48 + 4c397b6 commit 66947eeCopy full SHA for 66947ee

File tree

+34

-0

lines changed

+34

-0

lines changed

Lines changed: 34 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -801,6 +801,40 @@ impl Solution {`
`801`	`801`	`}`
`802`	`802`	```
`803`	`803`
	`804`	`+### Ruby`
	`805`	`+> 递归法:`
	`806`	+```ruby
	`807`	`+# @param {TreeNode} root`
	`808`	`+# @param {Integer} key`
	`809`	`+# @return {TreeNode}`
	`810`	`+def delete_node(root, key)`
	`811`	`+ return nil if root.nil?`
	`812`	`+`
	`813`	`+ right = root.right`
	`814`	`+ left = root.left`
	`815`	`+`
	`816`	`+ if root.val == key`
	`817`	`+ return right if left.nil?`
	`818`	`+ return left if right.nil?`
	`819`	`+`
	`820`	`+ node = right`
	`821`	`+ while node.left`
	`822`	`+ node = node.left`
	`823`	`+ end`
	`824`	`+ node.left = left`
	`825`	`+`
	`826`	`+ return right`
	`827`	`+ end`
	`828`	`+`
	`829`	`+ if root.val > key`
	`830`	`+ root.left = delete_node(left, key)`
	`831`	`+ else`
	`832`	`+ root.right = delete_node(right, key)`
	`833`	`+ end`
	`834`	`+`
	`835`	`+ return root`
	`836`	`+end`
	`837`	+```
`804`	`838`
`805`	`839`	`<p align="center">`
`806`	`840`	`<a href="https://programmercarl.com/other/kstar.html" target="_blank">`

Comments

(0)