Binary Trees A2 CS

Binary Trees A2 CS

11th - 12th Grade

•

23 Qs

quiz-placeholder

Similar activities

ICT WEBINAR QUIZ

ICT WEBINAR QUIZ

KG - Professional Development

•

20 Qs

Week 11 Quiz 2

Week 11 Quiz 2

10th Grade - University

•

20 Qs

Personal Finance 3.01-3.07 Review Quiz

Personal Finance 3.01-3.07 Review Quiz

9th - 12th Grade

•

20 Qs

Aplikom

Aplikom

1st Grade - University

•

20 Qs

PPG 25 Feb 2022

PPG 25 Feb 2022

12th Grade

•

19 Qs

Text and Image representation

Text and Image representation

11th Grade

•

22 Qs

IT (data, viruses and more)

IT (data, viruses and more)

8th Grade - Professional Development

•

20 Qs

quizz tkinter

quizz tkinter

11th Grade - University

•

20 Qs

Binary Trees A2 CS

Binary Trees A2 CS

Assessment

Quiz

•

Computers

•

11th - 12th Grade

•

Practice Problem

•

Hard

Created by

Ryan Coughlin

Used 5+ times

FREE Resource

AI

Enhance your content in a minute

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

23 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

When adding a new node to a tree, which is not a pointer that you need

FreePtr

NewNodePtr

CurrentPtr

PreviousPtr

NextPtr

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

When initialising the tree, what should the LeftPtr field have as a value?

The next index in the list

NullPtr

The RootPtr

The size of the array

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

#When adding a new node to the tree:


IF TurnedLeft = TRUE

THEN

Tree [________] .Left Pointer <- NewNodePtr

FreePtr

CurrentPtr

PreviousPtr

NullPtr

RootPtr

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

#When adding a new node to the tree:


Tree[_______] .Data <- Newitem

FreePtr

CurrentPtr

PreviousPtr

NewNodePtr

RootPtr

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

#When adding a new node to the tree:


WHILE ThisNodePtr <> ________// while not a leaf node

FreePtr

CurrentPtr

PreviousPtr

NullPtr

RootPtr

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

#When adding a new node to the tree:


IF Tree[ThisNodePtr] .Data > Newitem THEN

TurnedLeft <- TRUE

ThisNodePtr <- Tree [________].LeftPointer

FreePtr

ThisNodePtr

PreviousPtr

NullPtr

RootPtr

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

#When adding a new node to the tree:


________ <- ThisNodePtr // remember this node

FreePtr

ThisNodePtr

PreviousPtr

NullPtr

RootPtr

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?