Search Header Logo

REVISION BST

Authored by AZURA (PBU)

Education

Vocational training

Used 3+ times

REVISION BST
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

6 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

20 sec • 2 pts

GIVES KEYWORDS TO DESCRIBE BINARY TREE

GENERAL TREE

SEARCHING TREE NODES

ORGANIZATION CHART

NON LINEAR DATA STRUCTURE

2.

MULTIPLE CHOICE QUESTION

20 sec • 2 pts

STATE THE MAXIMUM CHILDREN OF TREE NODE

3

1

2

UNLIMITED

3.

MULTIPLE CHOICE QUESTION

20 sec • 2 pts

Media Image

CONSIDER CATEGORY OF BINARY TREE

FULL

FULL AND COMPLETE

COMPLETE

NEITHER FULL NOR COMPLETE

4.

MULTIPLE CHOICE QUESTION

20 sec • 2 pts

Media Image

CONSIDER CATEGORY OF BINARY TREE

FULL BUT NOT COMPLETE

COMPLETE BUT NOT FULL

FULL AND COMPLETE

NEITHER COMPLETE NOR FULL

5.

MULTIPLE CHOICE QUESTION

20 sec • 2 pts

Media Image

LIST INTERNAL NODES

60 55 25 50

20 10 60 55

20 60 30 10

30 10 100 67

6.

MULTIPLE CHOICE QUESTION

20 sec • 2 pts

Media Image

LIST EXTERNAL NODES

30 50 25 10 67

67 100 20 25 50

50 25 67 100 30

30 25 50 55 67

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?