title: Check Whether Given Degrees Vertices Represent Graph Tree
signature: checkWhetherGivenDegreesVerticesRepresentGraphTree(degree, n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(bool actual, bool expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(degree, n, bool expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(degree, n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          [2, 3, 1, 1, 1], 5, 
          true)
      }");
  
      print("TEST-1...${driver(
          [2, 2, 1, 1, 2], 5, 
          true)
      }");
  
      print("TEST-2...${driver(
          [2, 2, 1, 1, 1], 5, 
          false)
      }");
  
      print("TEST-3...${driver(
          [0, 0, 0, 3, 3, 4], 6, 
          true)
      }");
  
      print("TEST-4...${driver(
          [-10, 12, 2], 3, 
          true)
      }");
  
      print("TEST-5...${driver(
          [1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0], 19, 
          false)
      }");
  
      print("TEST-6...${driver(
          [1, 6, 10, 13, 15, 17, 18, 23, 26, 28, 30, 32, 32, 33, 36, 39, 39, 41, 43, 50, 50, 51, 53, 54, 59, 59, 63, 63, 63, 66, 66, 71, 71, 74, 78, 89, 89, 93], 30, 
          false)
      }");
  
      print("TEST-7...${driver(
          [66, -96, -14, 74, -20], 4, 
          false)
      }");
  
      print("TEST-8...${driver(
          [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], 31, 
          false)
      }");
  
      print("TEST-9...${driver(
          [97, 73, 87, 45, 64, 30, 53, 50, 62, 42, 28, 58, 31, 90], 10, 
          false)
      }");
  
      return 0;
  }
source_py: def check_whether_given_degrees_vertices_represent_graph_tree(degree, n):
      deg_sum = sum(degree)
      if ((2 * (n - 1)) == deg_sum):
          return True
      else:
          return False
source_cpp: bool check_whether_given_degrees_vertices_represent_graph_tree(vector<int> degree, int n) {
    int deg_sum = 0;
    for ( int i = 0;
    i < n;
    i ++ ) deg_sum += degree [ i ];
    return ( 2 * ( n - 1 ) == deg_sum );
  }