code: def test_round_trip():
      def doit(t, b):
          e, n = Prufer.edges(*t)
          t = Prufer(e, n)
          a = sorted(t.tree_repr)
          b = [i - 1 for i in b]
          assert t.prufer_repr == b
          assert sorted(Prufer(b).tree_repr) == a
          assert Prufer.unrank(t.rank, n).prufer_repr == b
  
      doit([[1, 2]], [])
      doit([[2, 1, 3]], [1])
      doit([[1, 3, 2]], [3])
      doit([[1, 2, 3]], [2])
      doit([[2, 1, 4], [1, 3]], [1, 1])
      doit([[3, 2, 1, 4]], [2, 1])
      doit([[3, 2, 1], [2, 4]], [2, 2])
      doit([[1, 3, 2, 4]], [3, 2])
      doit([[1, 4, 2, 3]], [4, 2])
      doit([[3, 1, 4, 2]], [4, 1])
      doit([[4, 2, 1, 3]], [1, 2])
      doit([[1, 2, 4, 3]], [2, 4])
      doit([[1, 3, 4, 2]], [3, 4])
      doit([[2, 4, 1], [4, 3]], [4, 4])
      doit([[1, 2, 3, 4]], [2, 3])
      doit([[2, 3, 1], [3, 4]], [3, 3])
      doit([[1, 4, 3, 2]], [4, 3])
      doit([[2, 1, 4, 3]], [1, 4])
      doit([[2, 1, 3, 4]], [1, 3])
      doit([[6, 2, 1, 4], [1, 3, 5, 8], [3, 7]], [1, 2, 1, 3, 3, 5])
  
imports: from sympy.combinatorics.prufer import Prufer
  from sympy.testing.pytest import raises
label_desc: Use image node_id 2 for calling a global function with example usage: test_round_trip() without return types