query about the implementation of binary tree in python

Question

the following code is taken from the book DSA in python by Goodrich. I understand the theory of the binary tree ADT using linked structure but i am unable to ge