QQ聊天记录可以作为F2签证的准备材料么?# Joke - 肚皮舞运动
h*g
1 楼
convert a random array to BST: o(nlogn)
insertion: o(logn)
deletion: o(logn)
貌似deletion有三种情况，
1 Deleting a leaf (node with no children): Deleting a leaf is easy, as we
can simply remove it from the tree.
2 Deleting a node with one child: Remove the node and replace it with its
child.
3 Deleting a node with two children:
这三种情况不都是O(logn)吧？
insertion: o(logn)
deletion: o(logn)
貌似deletion有三种情况，
1 Deleting a leaf (node with no children): Deleting a leaf is easy, as we
can simply remove it from the tree.
2 Deleting a node with one child: Remove the node and replace it with its
child.
3 Deleting a node with two children:
这三种情况不都是O(logn)吧？
