binarytree(new_nodet right_child self right_child self right_child def get_right_child(self)return self right_child def get_left_child(self)return self left_child def set_root_val(selfobj)self key obj def get_root_val(self)return self key binarytree(' 'print( get_root_val()print( get_left_child() insert_left(' 'print( get_left_child()print( get_left_child(get_root_val() insert_right(' 'print( get_right_child()print( get_right_child(get_root_val() get_right_child(set_root_val('hello'print( get_right_child(get_root_val()self check write function build_tree that returns tree using the nodes and references implementation that looks like this implementation