0 [{"id":516354,"quiz_id":"26287","answer_id":null,"answerType_id":"0","created_at":"2018-08-03 20:47:21","updated_at":"2018-08-03 20:47:21","questionName":"Which of the following most accurately describes the behavior of a queue?","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":516358,"quiz_id":"26287","answer_id":null,"answerType_id":"0","created_at":"2018-08-03 20:51:35","updated_at":"2018-08-03 20:51:35","questionName":"Which of the following would not be a good application for a binary tree?","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":516353,"quiz_id":"26287","answer_id":null,"answerType_id":"0","created_at":"2018-08-03 20:38:15","updated_at":"2018-08-03 20:38:15","questionName":"Compared with a linked list, a binary tree ________.","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":516355,"quiz_id":"26287","answer_id":null,"answerType_id":"0","created_at":"2018-08-03 20:48:09","updated_at":"2018-08-03 20:48:09","questionName":"When a queue is represented using a single-linked list, the links should","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":516356,"quiz_id":"26287","answer_id":null,"answerType_id":"0","created_at":"2018-08-03 20:48:36","updated_at":"2018-08-03 20:48:36","questionName":"Suppose the following operations are performed on an empty queue: Push A, push B, push C, push E, pop, and push D. What would be the next value to be accessed from this queue?","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":516418,"quiz_id":"26287","answer_id":null,"answerType_id":"0","created_at":"2018-08-04 03:00:14","updated_at":"2018-08-04 03:00:14","questionName":"If the size of a heap is n, the performance","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":516420,"quiz_id":"26287","answer_id":null,"answerType_id":"0","created_at":"2018-08-04 03:00:54","updated_at":"2018-08-04 03:00:54","questionName":"A Priority Queue","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":516416,"quiz_id":"26287","answer_id":null,"answerType_id":"0","created_at":"2018-08-04 02:59:41","updated_at":"2018-08-04 02:59:41","questionName":"A heap","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":516357,"quiz_id":"26287","answer_id":null,"answerType_id":"0","created_at":"2018-08-03 20:51:07","updated_at":"2018-08-03 20:51:07","questionName":"Searching for an item in a linked list is O(___). Searching in a binary search tree is O(___).","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":516361,"quiz_id":"26287","answer_id":null,"answerType_id":"0","created_at":"2018-08-03 20:54:29","updated_at":"2018-08-03 20:54:29","questionName":"If a particular binary tree is full and has 100 leaf nodes, how many internal nodes does it have?","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":516360,"quiz_id":"26287","answer_id":null,"answerType_id":"0","created_at":"2018-08-03 20:53:49","updated_at":"2018-08-03 20:53:49","questionName":"Suppose you have a binary search tree. Which kind of traversal would print the contents in increasing order?","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":516352,"quiz_id":"26287","answer_id":null,"answerType_id":"0","created_at":"2018-08-03 20:37:42","updated_at":"2018-08-03 20:37:42","questionName":"Pick the best statement","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":516413,"quiz_id":"26287","answer_id":null,"answerType_id":"0","created_at":"2018-08-04 02:57:43","updated_at":"2018-08-04 02:57:43","questionName":"Which of the following is a true about Binary Trees?","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":516412,"quiz_id":"26287","answer_id":null,"answerType_id":"0","created_at":"2018-08-04 02:57:00","updated_at":"2018-08-04 02:57:00","questionName":"If the number 3 is inserted into the following binary tree, what would be the pre-order traversal order?\r\n\r\n 5 \/ \\ 1 10 \/ \\ \/ 0 4 7 \\ 9 ","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":516359,"quiz_id":"26287","answer_id":null,"answerType_id":"0","created_at":"2018-08-03 20:53:06","updated_at":"2018-08-03 20:53:06","questionName":"__________ traversal doesn't exist.","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null}]

block

Which of the following most accurately describes the behavior of a queue?

Select the correct answer(s).  

(0/0)

---

First in, first out (FIFO).

Last in, first out (LIFO)

None of the above.

First in, last out (FILO)

none

Which of the following would not be a good application for a binary tree?

Select the correct answer(s).  

(0/0)

---

A Huffman tree.

An expression tree.

A family tree.

A search tree.

none

Compared with a linked list, a binary tree ________.

Select the correct answer(s).  

(0/0)

---

is virtually the same

is better at representing a sequence of numbers

has nodes with two child nodes instead of one next node

is less effective at representing genealogy

none

When a queue is represented using a single-linked list, the links should

Select the correct answer(s).  

(0/0)

---

be double links since you can’t do it with single links.

point either from rear to front, or front to rear; it doesn’t matter.

point from the rear toward the front.

point from the front toward the rear.

none

Suppose the following operations are performed on an empty queue: Push A, push B, push C, push E, pop, and push D. What would be the next value to be accessed from this queue?

Select the correct answer(s).  

(0/0)

---

C

E

A

D

B

none

If the size of a heap is n, the performance

Select the correct answer(s).  

(0/0)

---

is O(n2) for restructuring.

is O(1) for deletion.

is O(log n) for insertion.

is O(n) for deletion.

none

A Priority Queue

Select the correct answer(s).  

(0/0)

---

is a container.

sometimes uses a LIFO to implement a waiting line.

is a container adapter that uses a specific underlying container, e.g. vector or deque.

is implemented with a stack.

none

A heap

Select the correct answer(s).  

(0/0)

---

requires every subtree to be a heap.

is a full binary tree.

only requires the root value to be greater than or equal to all items in the tree.

is a full and complete binary tree.

none

Searching for an item in a linked list is O(___). Searching in a binary search tree is O(___).

Select the correct answer(s).  

(0/0)

---

n^2, n

n, log(n)

n, n

log(n), log(n)

none

If a particular binary tree is full and has 100 leaf nodes, how many internal nodes does it have?

Select the correct answer(s).  

(0/0)

---

Not determinable.

100

99

101

none

Suppose you have a binary search tree. Which kind of traversal would print the contents in increasing order?

Select the correct answer(s).  

(0/0)

---

Postorder.

Preorder.

It doesn't matter, all would work.

Inorder

none

Pick the best statement

Select the correct answer(s).  

(0/0)

---

A complete binary tree is a full binary tree and a full binary tree is a complete binary tree.

A full binary tree need not be complete and a complete binary tree need not be full.

A complete binary tree is a full binary tree.

A full binary tree is a complete binary tree.

none

Which of the following is a true about Binary Trees?

Select the correct answer(s).  

(0/0)

---

Every complete binary tree is also a full binary tree.

Every full binary tree is also a complete binary tree.

None of these.

Every binary tree is either complete or full.

No binary tree is both complete and full.

none

If the number 3 is inserted into the following binary tree, what would be the pre-order traversal order? 5 / \ 1 10 / \ / 0 4 7 \ 9

Select the correct answer(s).  

(0/0)

---

5 1 10 0 4 7 3 9

0 1 3 4 5 7 9 10

5 1 0 4 3 10 7 9

None of the above.

none

__________ traversal doesn't exist.

Select the correct answer(s).  

(0/0)

---

Outorder

Inorder

Preorder

Postorder