I was told to repost the others in a seperate post. eof a tree is the number of

Question

I was told to repost the others in a seperate post.

eof a tree is the number of nodes on the longest path from the root to a leaf. a) height b) length c) width d) age 12) In of height h, all nodes that are at a level less than h have two children each. a a) general tree 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. a) full binary tree b) complete binary tree c) balanced binary tree d) general tree 14) In 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) treeli+21 b) tree[i-2] c) tree [2 i+1 d) tree [2*i+2]

Explanation / Answer

Hi, I have answered first 10.

Please repost others in separate post.

11) a) height
12) c) full binary tree
13) b) complete binary tree
14) d) balanced binary tree
15) b)
16) a) O(n)
17) c)
18) d)
19) b)
20) a) field

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

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