Which of these statements is not true?In a node tree, the top node is called the rootEvery node, except the root, has exactly one parent nodeA node can have any number of childrenA leaf is a node with the same parent

In a strict binary tree a node can have 0 children.Correct answer  True You Answered  False

In a binary tree, the node that is directly above another node is called the _____ of that node.a)childb)siblingc)parentd)leaf

Which of the following statements about trees in graph theory is true?AA tree can contain cyclesBA tree is always a disconnected graphCA tree with n vertices has n−1 edgesDA tree has at least one cycle

Which of the following is true?Every simple graph with 5 vertices and 4 edges is a tree.Every connected graph with 8 vertices and 9 edges is a tree.Every simple connected graph with 6 vertices and 7 edges is a tree.Every tree with 11 vertices is simple, connected and has 10 edges.unanswered

In a tree, there must be only a single path from the root node to any other nodes in the tree a. Disagree b. Agree