menu
home
Home
search
Search
people
About Us
exit_to_app
Login
home
Home
search
Search
people
About Us
exit_to_app
Login
Practicing for Red Black Tree of Data Structure
Questions 1 of 9
Q. What is the special property of red-black trees and what root should always be?
a color which is either red or black and root should always be black color only
height of the tree
pointer to next node
a color which is either green or black
Submit
lock
Login
person
Signup
Email
Password
Name
Email
Password
Confirm Password