def get_right_child(root)return root[ the following code exercises the tree functions we have just written you should try it out for yourself one of the exercises asks you to draw the tree structure resulting from this set of calls def binary_tree( )return [ [][]def insert_left(rootnew_branch) root pop( if len( root insert( [new_brancht[]]elseroot insert( [new_branch[][]]return root def insert_right(rootnew_branch) root pop( if len( root insert( [new_branch[] ]elseroot insert( [new_branch[][]]return root def get_root_val(root)return root[ def set_root_val(rootnew_val)root[ new_val def get_left_child(root)return root[ def get_right_child(root)return root[ binary_tree( insert_left( insert_left( insert_right( insert_right( get_left_child(rprint(lset_root_val( print(rinsert_left( print( implementation