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 这样吧
相关阅读
大家找工作的都怎样了？请问resign letter对以后有影响吗？writing sample该交什么好？请问谁有用Skype面试过？犹豫不决中All I need is a job!!!被学校ISO弄晕了. 大家帮忙看看愁死了！似乎有一线希望但opt月底expire了……急:请教一个关于找工作签offer的法律问题 (转载)很痛苦的鸡肋OfferOPT电话加急关于background check问下哪找prevailing wage的数据？Chinese-speaking buyer assistant needed immediately: sponsor H1B大伙准备面试一般准备哪个语言？C++?wsn来做数学题了，江苏省数学最后一题 (转载)on-site面试自己掏腰包的花费收据啥时候找公司报比较好？怎么知道OPT加急成功了呢NSC的OPT是不是一定得打电话啊？实习生如何称呼mentor和manager？