最近改动

更新题目 满二叉树节点故障概率

题目 everpure-oa-tree-failure-probability · 修改（rev 4） · cc · 2026-10-27 12:09

body

@@ -23,5 +23,3 @@
 follow-up：树变高，节点数翻倍，平均路径长只多 1 左右，失败率约等于 (层数) / N，变小，所以**成功率更高**。
 
-## 英文讲法
-
 > [!say] The traversal fails only if the dead node is on the root-to-target path, so the failure probability is the expected path length divided by the number of nodes. That is about five over sixty-three here, so success is above ninety percent, and it only gets better as the tree grows.