Introduction to Java Programming, Includes Data Structures, Eleventh Edition, Y. Daniel Liang

This quiz is for students to practice. A large number of additional quiz is available for instructors using Quiz Generator from the Instructor's Resource Website. Videos for Java, Python, and C++ can be found at https://yongdanielliang.github.io/revelvideos.html.

Chapter 43 Red-Black Trees


43.1  Which of the following statements are correct?
A. A red-black tree is a binary search tree.
B. All leaf nodes are colored black in a red-black tree.
C. All leaf nodes are colored red in a red-black tree.
D. All external nodes are leaf nodes.
E. All leaf nodes are external nodes.

43.2  Which of the following statements are correct?
A. The black depth of a node is defined as the number of black nodes in a path from the node to the root.
B. The root is black.
C. Two adjacent nodes cannot be both red.
D. All external nodes have the same black depth.