Trees, Graphs and Other data structures

Question 1

define a tree of T of size n

Answer 1

it is a tuple consisting of V ={v1,v2, … ,vn} and E = {e1,e2, … , e(n-1)}
where ei = {vj,vk} where j does not equal k

and for every vi and vj there is some path between the two where i does not equal j

Question 2

define a rooted tree

Answer 2

triple T = {v,V,E}
where v is a member of V