Trees quizz

Trees quizz

University

14 Qs

quiz-placeholder

Similar activities

Test N°9 (Management) BTS : Logique d'affaires et d'innovations

Test N°9 (Management) BTS : Logique d'affaires et d'innovations

University

11 Qs

De la musique avant toute chose (mots-clés)

De la musique avant toute chose (mots-clés)

University

14 Qs

Tabla periódica

Tabla periódica

1st Grade - University

17 Qs

POs and BTL

POs and BTL

University

15 Qs

EXAMEN - QUIMICA I - CONALEP

EXAMEN - QUIMICA I - CONALEP

University

15 Qs

POST TEST MPLS ONLINE SMK NEGERI 1 TUTUYAN 2020

POST TEST MPLS ONLINE SMK NEGERI 1 TUTUYAN 2020

KG - Professional Development

15 Qs

Diritto amministrativo (quiz#001-10)

Diritto amministrativo (quiz#001-10)

KG - Professional Development

11 Qs

NLKT_1

NLKT_1

University

19 Qs

Trees quizz

Trees quizz

Assessment

Quiz

Education

University

Practice Problem

Medium

Created by

Auzoom four

Used 4+ times

FREE Resource

AI

Enhance your content in a minute

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

14 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

In a binary search tree, the left subtree of a node contains nodes with values:

A) Greater than the node's value

B) Less than the node's value

C) Equal to the node's value

D) Random values

2.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

. Which traversal technique is used to find the minimum element in a binary search tree (BST)?

A) Pre-order traversal

B) In-order traversal

C) Post-order traversal

D) Leftmost traversal

3.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

What is the time complexity of searching an element in a balanced binary search tree (BST)?

A) O(1)

B) O(log n)

C) O(n)

D) O(n log n)

4.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Which of the following is the correct definition of a Red-Black Tree?

A) A self-balancing binary search tree

B) A binary tree where each node is colored either red or black

C) Both A and B

D) None of the above

5.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

What is the time complexity of inserting an element into an AVL tree?

A) O(1)

B) O(log n)

C) O(n)

D) O(n log n)

6.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Which of the following statements is true about a heap data structure?

A) It is a binary tree.

B) In a max-heap, the parent node is always smaller than its children.

C) It is used to implement priority queues.

D) It is always a balanced tree.

7.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Which traversal method is best used to print the nodes of a binary tree in ascending order?

A) Pre-order traversal

B) In-order traversal

C) Post-order traversal

D) Level-order traversal

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?