MCPcopy Create free account
hub / github.com/subbarayudu-j/TheAlgorithms-Python / main

Function main

binary_tree/basic_binary_tree.py:31–43  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

29
30
31def main(): # Main func for testing.
32 tree = Node(1)
33 tree.left = Node(2)
34 tree.right = Node(3)
35 tree.left.left = Node(4)
36 tree.left.right = Node(5)
37 tree.left.right.left = Node(6)
38 tree.right.left = Node(7)
39 tree.right.left.left = Node(8)
40 tree.right.left.left.right = Node(9)
41
42 print(is_full_binary_tree(tree))
43 print(depth_of_tree(tree))
44
45
46if __name__ == '__main__':

Callers 1

Calls 3

is_full_binary_treeFunction · 0.85
depth_of_treeFunction · 0.85
NodeClass · 0.70

Tested by

no test coverage detected