title: Check Whether Given Degrees Vertices Represent Graph Tree
signature: pub fn check_whether_given_degrees_vertices_represent_graph_tree(degree: Vec<i32>, n: i32) -> bool {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: bool, expected: bool)->bool{
  return actual==expected
  }
  pub fn driver(degree: Vec<i32>, n: i32, expected: bool)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(degree, n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        Vec::from([2, 3, 1, 1, 1]), 5, 
        true
      ));
      
      println!("TEST-1...{}", driver(
        Vec::from([2, 2, 1, 1, 2]), 5, 
        true
      ));
      
      println!("TEST-2...{}", driver(
        Vec::from([2, 2, 1, 1, 1]), 5, 
        false
      ));
      
      println!("TEST-3...{}", driver(
        Vec::from([0, 0, 0, 3, 3, 4]), 6, 
        true
      ));
      
      println!("TEST-4...{}", driver(
        Vec::from([-10, 12, 2]), 3, 
        true
      ));
      
      println!("TEST-5...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-6...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-7...{}", driver(
        Vec::from([66, -96, -14, 74, -20]), 4, 
        false
      ));
      
      println!("TEST-8...{}", driver(
        Vec::from([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
      ));
      
      println!("TEST-9...{}", driver(
        Vec::from([97, 73, 87, 45, 64, 30, 53, 50, 62, 42, 28, 58, 31, 90]), 10, 
        false
      ));
      
  }
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 );
  }