MEGA TREE REVIEW

MEGA TREE REVIEW

University

•

36 Qs

quiz-placeholder

Similar activities

MOS Word 2016 - Quiz 2

MOS Word 2016 - Quiz 2

University

•

34 Qs

Class Test 1 - CSE 443 (Mobile Telecommunication)

Class Test 1 - CSE 443 (Mobile Telecommunication)

University

•

40 Qs

PENILAIAN TENGAH SEMESTER INFORMATIKA

PENILAIAN TENGAH SEMESTER INFORMATIKA

8th Grade - University

•

35 Qs

MTA Windows OS Fundamentals Test 1

MTA Windows OS Fundamentals Test 1

9th Grade - Professional Development

•

35 Qs

Quiz 2 - Fall 2023

Quiz 2 - Fall 2023

University

•

35 Qs

Security Part 2( Technical Diploma)

Security Part 2( Technical Diploma)

University

•

35 Qs

Soal WAN Tkj kls 2

Soal WAN Tkj kls 2

University

•

41 Qs

UJIAN MID SEMESTER 1 X RPL SISTEM KOMPUTER

UJIAN MID SEMESTER 1 X RPL SISTEM KOMPUTER

University

•

35 Qs

MEGA TREE REVIEW

MEGA TREE REVIEW

Assessment

Quiz

•

Computers

•

University

•

Practice Problem

•

Medium

Created by

Alan Cortez

Used 7+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

36 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

The definition of a FULL tree ALWAYS means that...

  • - all levels, except possibly the last level, are completely full

  • - all nodes in the last level are as far left as possible.

  • - every node contains 0 or 2 children.

  • - all internal nodes have 2 children

  • - all leaf nodes are at the same level

2.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

The definition of a COMPLETE tree ALWAYS means that...

  • - all levels, except possibly the last level, are completely full

  • - all nodes in the last level are as far left as possible.

  • - every node contains 0 or 2 children.

  • - all internal nodes have 2 children

  • - all leaf nodes are at the same level

3.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

The definition of a PERFECT tree ALWAYS means that...

  • - all levels, except possibly the last level, are completely full

  • - all nodes in the last level are as far left as possible.

  • - every node contains 0 or 2 children.

  • - all internal nodes have 2 children

  • - all leaf nodes are at the same level

4.

MULTIPLE SELECT QUESTION

45 sec • 1 pt

Media Image

This tree is:

Complete

Full

Perfect

Neither

5.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

Media Image

This tree is:

Complete

Full

Perfect

Neither

6.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

Media Image

This tree is:

Complete

Full

Perfect

Neither

7.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

Media Image

This tree is:

Complete

Full

Perfect

Neither

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?

Discover more resources for Computers