MADD

In an ordered rooted tree, which of the following is true about the universal address system?

• Each node is labeled by its position in a postorder traversal.

• Each node is labeled by its position from the root to itself.

• Each node is labeled by its depth in the tree.

• Each node is labeled by its distance from the nearest leaf.

hat is the address of the parent of a node labeled 3.4.5 in a universal address system?

• 3.5

• 3.4

• 3

• 4.5

In the universal address system, which label represents the root of a tree?

• 1

• 0

• 1.1

• None

If a vertex in an ordered rooted tree has the address 2.3.4, how many levels deep is it?

• 1

• 2

• 3

• 4

What is the minimum number of vertices in a tree if the address of one vertex is 3.4.5?

• 3

• 4

• 5

• 6

If a tree node has the address 2.3, what is the address of its child in the first position?

• 2.4

• 2.3.1

• 3.1

• 2.1

Which of the following is an example of a lexicographic order for tree vertices?

• 1, 2, 3, 4

• 1.1, 1.2, 2.1, 2.2

• 1.2, 1.3, 2.1, 2.2

• 1.1, 2.2, 3.1, 3.2

In a preorder traversal of a tree, in what order are the vertices visited?

• Root, left subtree, right subtree

• Left subtree, root, right subtree

• sai nên đừng chọn

• sai nên đừng chọn

How can the address system help in determining the number of vertices in a tree?

• By counting only the leaf nodes

• chọn là có điểm

• By calculating the depth of the tree

• None of the above

In a postorder traversal, which of the following orders is correct for a rooted tree?

• Left subtree, right subtree, root

• có 1 câu đúng

• có 1 câu đúng

• có 1 câu đúng