MCPcopy Create free account
hub / github.com/bterwijn/memory_graph / insert_recursive

Method insert_recursive

memory_graph/test.py:190–204  ·  view source on GitHub ↗
(self, node, value)

Source from the content-addressed store, hash-verified

188 self.root = None
189
190 def insert_recursive(self, node, value):
191 nn = None
192 if value < node.value:
193 if node.smaller is None:
194 nn = Node(value)
195 node.smaller = nn
196 else:
197 nn = self.insert_recursive(node.smaller, value)
198 else:
199 if node.larger is None:
200 nn = Node(value)
201 node.larger = nn
202 else:
203 nn = self.insert_recursive(node.larger, value)
204 return nn
205
206 def insert(self, value):
207 nn = None

Callers 1

insertMethod · 0.95

Calls 1

NodeClass · 0.70

Tested by

no test coverage detected