warm up MST, Cut Property, Generic MST Algorithm MST vs SPT A shortest paths tree depends on the start vertex:
Because it tells you how to get from a source to EVERYTHING. There is no source for a MST.
Nonetheless, the MST sometimes happens to be an SPT for a specific vertex.
两者关系不大？ Cut Property 简单证明 cross bridge 一定在 MST 中。 Generic MST Algorithm Start with no edges in the MST.
Depth First Paths “Depth First Search” is a more general term for any graph search algorithm that traverses a graph as deep as possible before backtracking.
The term is used for several slightly different algorithms. For example: DFS may refer to the version from the previous lecture that doesn’t use any marks (and thus can get caught in a loop). DFS may refer to the version where vertices are marked. DFS may refer to a version where vertices are marked and source edges recorded (as in Depth First Paths).
For BSTs, the most inefficient way to add is in to put it in order.
在二叉搜索树（BST）中，最低效的方式是按升序或降序插入节点，因为这种方式会导致树变成一条链表，从而使其性能退化到O(n)的时间复杂度。
这里是一个用Java实现的例子，展示了按升序插入节点的二叉搜索树（BST）会变成链表的情况：
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 // 定义树的节点 class TreeNode { int value; TreeNode left; TreeNode right; TreeNode(int value) { this.
