title: Check Whether Given Degrees Vertices Represent Graph Tree
signature: function checkWhetherGivenDegreesVerticesRepresentGraphTree($degree, $n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($degree, $n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($degree, $n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        array(2, 3, 1, 1, 1), 5, 
        true));
      
      printf("TEST-1...%s\n",driver(
        array(2, 2, 1, 1, 2), 5, 
        true));
      
      printf("TEST-2...%s\n",driver(
        array(2, 2, 1, 1, 1), 5, 
        false));
      
      printf("TEST-3...%s\n",driver(
        array(0, 0, 0, 3, 3, 4), 6, 
        true));
      
      printf("TEST-4...%s\n",driver(
        array(-10, 12, 2), 3, 
        true));
      
      printf("TEST-5...%s\n",driver(
        array(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));
      
      printf("TEST-6...%s\n",driver(
        array(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));
      
      printf("TEST-7...%s\n",driver(
        array(66, -96, -14, 74, -20), 4, 
        false));
      
      printf("TEST-8...%s\n",driver(
        array(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));
      
      printf("TEST-9...%s\n",driver(
        array(97, 73, 87, 45, 64, 30, 53, 50, 62, 42, 28, 58, 31, 90), 10, 
        false));
      
  }
  
  main();
  ?>
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 );
  }