FilesExpand file tree

master

/

basic_binary_tree.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

47 lines (38 loc) · 1.1 KB

master

/

basic_binary_tree.py

Copy path

Top

File metadata and controls

• Code
• Blame

47 lines (38 loc) · 1.1 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

class Node:

def __init__(self, data):

self.data = data

self.left = None

self.right = None

def depth_of_tree(tree):

if tree is None:

return 0

else:

depth_l_tree = depth_of_tree(tree.left)

depth_r_tree = depth_of_tree(tree.right)

if depth_l_tree > depth_r_tree:

return 1 + depth_l_tree

else:

return 1 + depth_r_tree

def is_full_binary_tree(tree):

if tree is None:

return True

if (tree.left is None) and (tree.right is None):

return True

if (tree.left is not None) and (tree.right is not None):

return (is_full_binary_tree(tree.left) and is_full_binary_tree(tree.right))

else:

return False

def main():

tree = Node(1)

tree.left = Node(2)

tree.right = Node(3)

tree.left.left = Node(4)

tree.left.right = Node(5)

tree.left.right.left = Node(6)

tree.right.left = Node(7)

tree.right.left.left = Node(8)

tree.right.left.left.right = Node(9)

print(is_full_binary_tree(tree))

print(depth_of_tree(tree))

if __name__ == '__main__':

main()