Question

True or False?

1. In a 2-3 tree, the last node that splits is a leaf that already contains two entries.

2. In a red-black tree, a red node cannot have red children.

3. The vertices in a graph may only have one topological order.

4. In a weighted graph, the shortest path between two given vertices has the largest edge-weight sum.

Answer 1

1.)

• In a 2-3 tree spilliting starts at leaf and goes up till the root
• so, the last node that splits is a root that contains 2 nodes.
• Answer: False

2.)

• A red node cannot have a red child or a red parent. that is, No two adjancent nodes can be of same color.
• Answer: True.

3.)

• Some priority constraints can be specified for a Graph, and more than one topological ordering can be obtained.
• Answer: False

4.)

• The shortest path between any two vertices is the path with SMALLEST edge weight sum
• Answer: False.