Exam 12: Heaps and Priority Queues
Exam 1: Introduction36 Questions
Exam 2: Analysis of Algorithms31 Questions
Exam 3: Introduction to Collections - Stacks49 Questions
Exam 4: Linked Structures - Stacks51 Questions
Exam 5: Queues28 Questions
Exam 6: Lists42 Questions
Exam 7: Iterators32 Questions
Exam 8: Recursion57 Questions
Exam 9: Searching and Sorting54 Questions
Exam 10: Trees47 Questions
Exam 11: Binary Search Trees50 Questions
Exam 12: Heaps and Priority Queues29 Questions
Exam 13: Sets and Maps47 Questions
Exam 14: Multi-Way Search Trees47 Questions
Exam 15: Graphs29 Questions
Exam 16: UML16 Questions
Exam 17: Object-Oriented Design54 Questions
Select questions type
A 2-4 tree expands on the concept a 2-3 tree to include the use of 4-nodes.
(True/False)
4.8/5
(33)
A ______ tree expands on the concept a 2-3 tree to include the use of 4-nodes.
(Short Answer)
4.8/5
(32)
If the ______ effect of a 2-3 tree insertion causes the root to split, the tree increases in height.
(Short Answer)
4.9/5
(46)
A 2-3 tree contains nodes that contain either one or two elements and have zero, two, or three children.
(True/False)
4.9/5
(30)
A _____ tree contains nodes that contain either one or two elements and have zero, two, or three children.
(Multiple Choice)
4.8/5
(35)
A _________ search tree can have more than two children per node and can store more than one element in each node.
(Multiple Choice)
4.8/5
(35)
A ______ tree contains nodes that contain either one or two elements and have zero, two, or three children.
(Short Answer)
4.7/5
(38)
A multi-way search tree can have more than ____ children per node and can store more than one element in each node.
(Short Answer)
4.7/5
(34)
Showing 21 - 29 of 29
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)