(self)
| 117 | self.tree.show_edge(n.id, n.right.id) |
| 118 | |
| 119 | def build_segment_tree(self): |
| 120 | array = AlgoVector(self, self.datas) |
| 121 | array.set_color(BLUE) |
| 122 | self.play(ShowCreation(array)) |
| 123 | self.play(array.to_edge, UP) |
| 124 | self.array = array |
| 125 | |
| 126 | self.show_message("后序创建二叉树", delay=0) |
| 127 | self.tree = AlgoSegTree(self, self.datas) |
| 128 | self.tree.scale(0.9) |
| 129 | self.tree.shift(UP*0.5) |
| 130 | self.add(self.tree) |
| 131 | self.tree.hide_all() |
| 132 | self.travel(self.tree.root) |
| 133 | |
| 134 | self.play(Uncreate(self.tree), Uncreate(array)) |
| 135 | self.show_message("再来看看如何更新线段树") |
| 136 | |
| 137 | def find_element(self, node, val, new_val): |
| 138 | if node.l==node.r and node.v == val: |
no test coverage detected