Search Header Logo

DS_13-01-Sort

Authored by Chun-Jung Lin

others

DS_13-01-Sort
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

13 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 10 pts

樹狀結構中,分支度(degree)為0之節點稱為:

樹根
樹葉
路徑
二元樹

2.

MULTIPLE CHOICE QUESTION

30 sec • 10 pts

Media Image

在下圖中,下列那一項敘述不正確?

A節點為B節點的父節點
E節點的階度(level)為1
樹之高度(height)為3
E節點與F節點為兄弟節點

3.

FILL IN THE BLANK QUESTION

30 sec • 10 pts

Media Image

請問這一棵樹有多少個樹葉節點?

4.

MULTIPLE CHOICE QUESTION

30 sec • 10 pts

從根節點到樹中所有葉節點的最長可能路徑,稱作樹的?

高度
階層
根節點
葉節點

5.

FILL IN THE BLANK QUESTION

30 sec • 10 pts

有一棵樹的分支度為6,並且有50 個節點,試問此棵樹需要多少個LINK 欄位,實際上用了幾個,浪費多少個LINK。

6.

FILL IN THE BLANK QUESTION

30 sec • 10 pts

有一棵樹共有50 個節點,每個節點的分支度為8,試問此棵樹共需多少個LINK 欄位,實際上使用幾個,浪費多少個LINK?

7.

FILL IN THE BLANK QUESTION

30 sec • 10 pts

假設樹根的階度(level) 為1,且整棵二元樹的階度為10,此棵二元樹總共有幾個節點?

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?