Midterm II

Wyjście

Pytanie 1 of 1

  Pozostały Czas


0 [{"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":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":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":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":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":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":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":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":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":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":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},{"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":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":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}]
516355
0
180
block

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

Wybierz prawidłowe odpowiedzi  

(0/0)












516353
0
180
none
516361
0
180
none
516357
0
180
none
516418
0
180
none
516356
0
180
none
516354
0
180
none
516358
0
180
none
516352
0
180
none
516360
0
180
none
516413
0
180
none
516359
0
180
none
516420
0
180
none
516412
0
180
none
516416
0
180
none