MCPcopy Index your code
hub / github.com/subbarayudu-j/TheAlgorithms-Python / getheight

Function getheight

data_structures/binary tree/AVLtree.py:55–58  ·  view source on GitHub ↗
(node)

Source from the content-addressed store, hash-verified

53 return
54
55def getheight(node):
56 if node is None:
57 return 0
58 return node.getheight()
59
60def my_max(a,b):
61 if a > b:

Callers 6

leftrotationFunction · 0.85
rightrotationFunction · 0.85
insert_nodeFunction · 0.85
del_nodeFunction · 0.85
getheightMethod · 0.85
testMethod · 0.85

Calls 1

getheightMethod · 0.45

Tested by

no test coverage detected