A node in a binary tree has Select one: a. zero or two children b. exactly two children cat most two children d. at least two children The level of the root node in a tree of height his Select one: ah+1 b. 1 ch-1 What is the chromatic number of a complete binary tree of height 67 Answer. If we remove an abitrary edge from a tree, then the resulting graph will be Select one: a. two distintres b. a tree ca cyclic graph o d several trees e. a connected graph