MCPcopy Index your code
hub / github.com/BeeBombshell/Python-DSA / find

Method find

Tree Data Structure/binarytree.py:35–39  ·  view source on GitHub ↗
(self, val)

Source from the content-addressed store, hash-verified

33 node.r = Node(val)
34 #to find an element if present in root node in tree
35 def find(self, val):
36 if self.root is not None:
37 return self._find(val, self.root)
38 else:
39 return None
40 # to find any element in tree
41 def _find(self, val, node):
42 if val == node.v:

Callers 1

binarytree.pyFile · 0.80

Calls 1

_findMethod · 0.95

Tested by

no test coverage detected