Homework Clinic
Science Clinic => Computer Science => Topic started by: karateprodigy on May 6, 2020
-
Question 1
In a B-tree of order 6, how many elements can a non-root have?
◦ 0
◦ 6
◦ 5
◦ 3
◦ 4
Question 2
Which of the following statements are correct?
◦ All leaf nodes are external nodes.
◦ A red-black tree is a binary search tree.
◦ All external nodes are leaf nodes.
◦ All leaf nodes are colored black in a red-black tree.
◦ All leaf nodes are colored red in a red-black tree.
-
Answer 1
▸5
▸3
▸4
Answer 2
▸All leaf nodes are external nodes.
▸A red-black tree is a binary search tree.