Insert the following 6 nodes in an empty red-black tree in order from left to right (e.g. 17 inserted first):
17, 14, 20, 19, 18, 7
Select all the statements below that are TRUE for the final red-black tree after all 6 insertions.
All the leaf nodes of the final tree are red. Note that the leaf nodes we are referring to are non-null nodes.
The root of the final tree is black.
The left-to-right level order traversal of this tree is 17, 14, 19, 7, 18, 20
The left-to-right level order traversal of this tree is 17, 14, 20, 7, 19, 18
The left-to-right level order traversal of this tree is 17, 14, 20, 7, 19, 18
The final tree is a full binary tree.
The final tree is a complete binary tree.
The final tree has same number of black and red nodes.
The final tree is a perfect binary tree.
