树与二叉树测试

树与二叉树测试

University

12 Qs

quiz-placeholder

Similar activities

计算机程序设计第一二章

计算机程序设计第一二章

University

10 Qs

python

python

University

10 Qs

7-面向对象编程、类与对象

7-面向对象编程、类与对象

University

10 Qs

Python Rocks

Python Rocks

University - Professional Development

10 Qs

移动通信5-2

移动通信5-2

University

10 Qs

树与二叉树测试

树与二叉树测试

Assessment

Quiz

Computers

University

Hard

Created by

w x

Used 1+ times

FREE Resource

12 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

二叉树中第五层(根的层号为1)上的结点个数最多为

8

15

16

32

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

深度为5的二叉树上的结点个数最多为()

15

16

31

32

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

在一棵度为4的树T中,若有20个度为4的结点,10个度为3的结点,1个度为2的结点,10个度为1的结点,则树T的叶结点个数是()

41

82

133

122

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

若有一个四叉树,度2的结点数为4,度3的结点数为3,问该树的叶结点个数是多少?

22

21

20

12

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

已知一棵完全二叉树的第九层(设根为第一层)有100个叶结点,则该完全二叉树的结点个数最多是

311

823

1847

无法确定

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

具有1102个结点的完全二叉树一定有()个叶子结点

79

551

1063

无法确定

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

具有65个叶结点的完全二叉树其深度为(根的深度为1):

8

7

6

5

Create a free account and access millions of resources

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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?