title: Check Whether Given Degrees Vertices Represent Graph Tree
signature: func checkWhetherGivenDegreesVerticesRepresentGraphTree(degree []int, n int) bool {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual bool, expected bool) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(degree []int, n int, expected bool) string {
      if validateSolution(PLACEHOLDER_FN_NAME(degree, n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver([]int{2, 3, 1, 1, 1}, 
  	5, true)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver([]int{2, 2, 1, 1, 2}, 
  	5, true)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver([]int{2, 2, 1, 1, 1}, 
  	5, false)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver([]int{0, 0, 0, 3, 3, 4}, 
  	6, true)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver([]int{-10, 12, 2}, 
  	3, true)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver([]int{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)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver([]int{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)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver([]int{66, -96, -14, 74, -20}, 
  	4, false)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver([]int{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)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver([]int{97, 73, 87, 45, 64, 30, 53, 50, 62, 42, 28, 58, 31, 90}, 
  	10, false)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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 );
  }