Scheduled maintenance: Thursday, January 26 from 6PM to 7PM PST
hello quizlet
Home
Subjects
Expert solutions
Create
Study sets, textbooks, questions
Log in
Sign up
Upgrade to remove ads
Only $35.99/year
Quiz 6
Flashcards
Learn
Test
Match
Flashcards
Learn
Test
Match
Terms in this set (11)
What is the expected running time for an insertion operation in a skip lists data structure?
O(log n)
Which one presents the resulting partitions of the following k-d tree? (See #2)
A
In a Red-Black tree the children of a red node can be either red or black.
False
Which one is the result of inserting y in the following skip lists for i = 2 using the provided algorithm? (See #4)
B
Which tree is not a red-black tree? (See #5)
D
In a text retrieval application we store words in a standard trie. What is the running time for a search operation in this trie?
O(d), where d is the alphabet size
We cannot use a k-d tree data structure to partition a space with more than 3 dimensions.a
False
What is the worst-case running time for a search operation in a k-d tree?
O(n)
What is the worst-case running time for a search operation in a red-black tree?
O(log n)
The root of a Red-Black tree is always black.
True
Properties of red black trees:
1. Root is black.
2. Every leaf is black. Leaves are null.
3. Children of every red node are black.
4. Every path from a node to a leaf contains the same number of black nodes. We call this black depth. All leaf nodes should have the same black depth.
Students also viewed
Study Guide OT 6 - 10001
21 terms
Quiz 3 - Weekly Math Quiz
29 terms
Vocabulary- Fourth Test (Study 40 Words)
40 terms
Policies Midterm
69 terms
Sets found in the same folder
Midterm 2
21 terms
Midterm 1
30 terms
Other sets by this creator
CMSC 411 Final
43 terms
final practice quiz
13 terms
Midterm practice quiz
8 terms
Quiz 6
10 terms
Other Quizlet sets
Sscg14
10 terms
New Testament first test
46 terms
EXAM 4 REVIEW
55 terms
Immunology Final
302 terms