Chapter 11: Trees 01) A node of a tree is called a(n) a) edge b) root c) branch

Question

Chapter 11: Trees 01) A node of a tree is called a(n) a) edge b) root c) branch d) vertex 02) The lines between the nodes of a tree are called b) edges d) subtrees 03) The node that is directly above node n in a tree is called the of node n. a) root b) leaf c) parent d) child 04) A node directly below node n in a tree is calleda of node n a) root b) leaf d) child 05) In a tree, the children of the same parent are called a) leafs b) siblings d) contemporaries 06) Each node in a tree has a) exactly one parent b at most one parencexactly two parents d) at most two parents 07) A node on the path from the root to node n is a(n) of node n a) ancestor b) descendant d) leaf 08) A descendant of node n is a node on a path from node n to a) the root b) a leaf c) a sibling of node n child of node n 09) A subtree of node n is a subtree rooted at b) the parent of node n c a child of node n b) at most one childcexactly two children d) at most two children b) length a) node n d) a sibling of node n 10) Each node in a binary tree has a) exactly one child of a tree is the number of nodes on the longest path from the root to a leaf a) height c) width d) age 12)Inaencral tree of height h, all nodes that are at a level less than h have two children each. b) binary tree c) full binary tree d) complete binary tree 13) A of height h is full down to level h - 1, with level h filled in from left to right. ullbinary tree b) complete binary tree balanced binary tree d) general tree 14 the left and right subtrees of any node have heights that differ by at most 1 a) all trees b) all binary tress c) n-ary trees d) balanced binary trees 15) Which of the following is NOT a property of a complete binary tree of height h? a) all nodes at level h - 2 and above have two children each b) when a node at level h 1 has children, all nodes to its left at the same level have two children each c) when a node at level h 1 has one child, it is a left child d) all leaves are at level h 16) The traversal of a binary tree is a) O(n) c) O(n2) d) O(logzn) 17) In an array based representation of a complete binary tree, which of the following represents the left child of node tree [i]? a) tree [i+2] b) tree[i-2] d) tree

Explanation / Answer

Hi, I have answered first 10 Questions.

Please repost others in separate post.

1. d) vertex
2. b) edges
3. c) parent
4. d) child
5. b) siblings
6. b) at most one parent
7. a) ancestor
8. b) a leaf
9) a) node n
10) d) at most two children

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.