algorithm Find(key, root): current-node := root while current-node is not Nil do if current-node.key = key then return current-node else if key < current-node.key then current-node := current-node.left else current-node := current-node.right
伪代码
最新推荐文章于 2022-11-06 01:50:35 发布