recovery BST 不考虑相同值的情况么？# JobHunting - 待字闺中
c*p
1 楼
BST 定义是left可以等于root，但right必须大于root。
解recovery bst的时候，不考虑相等么？只有大于了才算它错，可是当root和right相
等，这个时候，也是错的吧！
解recovery bst的时候，不考虑相等么？只有大于了才算它错，可是当root和right相
等，这个时候，也是错的吧！
J*3
2 楼
In computer science, a binary search tree (BST), sometimes also called an
ordered or sorted binary tree, is a node-based binary tree data structure
which has the following properties:[1]
The left subtree of a node contains only nodes with keys less than the node'
s key.
The right subtree of a node contains only nodes with keys greater than the
node's key.
The left and right subtree must each also be a binary search tree.
There must be no duplicate nodes.
Wiki
ordered or sorted binary tree, is a node-based binary tree data structure
which has the following properties:[1]
The left subtree of a node contains only nodes with keys less than the node'
s key.
The right subtree of a node contains only nodes with keys greater than the
node's key.
The left and right subtree must each also be a binary search tree.
There must be no duplicate nodes.
Wiki
c*p
3 楼
是哦，我刚看了一下，确实这么定义的，都没有相等的情况。
可是。。。cc150上边这道题，它这样说的哦。。。。
node'
【在 J****3 的大作中提到】
: In computer science, a binary search tree (BST), sometimes also called an
: ordered or sorted binary tree, is a node-based binary tree data structure
: which has the following properties:[1]
: The left subtree of a node contains only nodes with keys less than the node'
: s key.
: The right subtree of a node contains only nodes with keys greater than the
: node's key.
: The left and right subtree must each also be a binary search tree.
: There must be no duplicate nodes.
: Wiki
可是。。。cc150上边这道题，它这样说的哦。。。。
node'
【在 J****3 的大作中提到】
: In computer science, a binary search tree (BST), sometimes also called an
: ordered or sorted binary tree, is a node-based binary tree data structure
: which has the following properties:[1]
: The left subtree of a node contains only nodes with keys less than the node'
: s key.
: The right subtree of a node contains only nodes with keys greater than the
: node's key.
: The left and right subtree must each also be a binary search tree.
: There must be no duplicate nodes.
: Wiki
J*3
4 楼
那上面错了吧。 还是以
• every node has a key
• every node’s key is
node
x
larger than all keys in its left subtree smaller than all
keys in its right subtree 这样吧
• every node has a key
• every node’s key is
node
x
larger than all keys in its left subtree smaller than all
keys in its right subtree 这样吧
c*p
5 楼
嗯嗯，应该错了。。
误导我了。。。
【在 J****3 的大作中提到】
: 那上面错了吧。 还是以
: • every node has a key
: • every node’s key is
: node
: x
: larger than all keys in its left subtree smaller than all
: keys in its right subtree 这样吧
误导我了。。。
【在 J****3 的大作中提到】
: 那上面错了吧。 还是以
: • every node has a key
: • every node’s key is
: node
: x
: larger than all keys in its left subtree smaller than all
: keys in its right subtree 这样吧
h*a
6 楼
一个BST里面有没有相同的key都不一定的，要看具体情况，没必要纠结。具体的问题可
以有就有，都unique也正常。
【在 J****3 的大作中提到】
: 那上面错了吧。 还是以
: • every node has a key
: • every node’s key is
: node
: x
: larger than all keys in its left subtree smaller than all
: keys in its right subtree 这样吧
以有就有，都unique也正常。
【在 J****3 的大作中提到】
: 那上面错了吧。 还是以
: • every node has a key
: • every node’s key is
: node
: x
: larger than all keys in its left subtree smaller than all
: keys in its right subtree 这样吧
相关阅读
[朋友面的G]Find k largest element in sliding windowExternal Sorting是哪一道题？考虑了很久的一个问题，用了nosql 数据库，还需要加cache层吗？请教uber现在给SENIOR 码工的包裹范围是怎样的？RSU一般给多少？谢谢Cisco 面试完了。OPT如果不告诉学校自己失业了，它如何知道？说说自己被国人帮助的经历h1b transfer申请提交之后可以撤销吗大家negotiate的时候会多要base还是RSU？恳请分析电面的问题（半导体）组里唯一一个非阿三STUFF也跑路了H1B大潮中搭车问extension i-797的i-94问题Oracle 湾区和 Amazon offer 求建议发几个狗家onsite题有人做过Quora的challenge吗？要给lg买几件衬衫和领带面试用德州奥斯汀 Austin 寻内推和一起找工作的朋友微软需要合同工 ，特别需要会说中文的 (转载)OPT 申请照片背后忘记写名字和I94number会有问题吗？AIRBNB现在包裹如何？