What is/are the disadvantages of implementing tree using normal arrays?

have to know the maximum number of nodes possible before creation of trees

difficulty in knowing children nodes of a node

difficult in finding the parent of a node

Identify the reason which doesn’t play a key role to use threaded binary trees?

The storage required by stack and queue is more

The pointers in most of nodes of a binary tree are NULL

It is Difficult to find a successor node

Advantages of linked list representation of binary trees over arrays?

both dynamic size and ease in insertion/deletion

ease in randomly accessing a node

Disadvantages of linked list representation of binary trees over arrays?

Random access is not possible and extra memory with every element

Randomly accessing is not possible

Extra memory for a pointer is needed with every element in the list

What may be the psuedo code for finding the size of a tree?

find_size(root_node–>left_node) + 1 + find_size(root_node–>right_node)

find_size(root_node–>left_node) + find_size(root_node–>right_node)

find_size(root_node–>right_node) – 1

find_size(root_node–>left_node + 1

Which of the following is not an advantage of trees?

Undo/Redo operations in a notepad

What is a complete binary tree?

A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right

Each node has exactly zero or two children

A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left

A tree In which all nodes have degree 2

What is a full binary tree?

Each node has exactly zero or two children

Each node has exactly two children

All the leaves are at the same level

Each node has exactly one or two children

Which of the following is incorrect with respect to binary trees?

Let T be a binary tree with N nodes. Then the number of levels is at least floor(log (N + 1))

Let T be a binary tree. For every k ≥ 0, there are no more than 2k nodes in level k

Let T be a binary tree with λ levels. Then T has no more than 2λ – 1 nodes

Let T be a binary tree with N nodes. Then the number of levels is at least ceil(log (N + 1))

Which of the following properties are obeyed by all three tree – traversals?

Left subtrees are visited before right subtrees

Right subtrees are visited before left subtrees

Root node is visited before left subtree

Root node is visited before right subtree

CPS02-Day3-NWC -Set02

Authored by CCC info@ccc.training

English

Professional Development

Used 1+ times

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

Content View
Student View

30 questions

Show all answers

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the traversal strategy used in the binary tree?

depth-first traversal

breadth-first traversal

random traversal

Priority traversal

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What are the children for node ‘w’ of a complete-binary tree in an array representation?

2w and 2w+1

2+w and 2-w

w+1/2 and w/2

w-1/2 and w+1/2

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Consider a situation of writing a binary tree into a file with memory storage efficiency in mind, is array representation of tree is good?

yes because we are overcoming the need of pointers and so space efficiency

yes because array values are indexable

No it is not efficient in case of sparse trees and remaning cases it is fine

No linked list representation of tree is only fine

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the parent for a node ‘w’ of a complete binary tree in an array representation when w is not 0?

floor(w-1/2)

ceil(w-1/2)

w-1/2

w/2

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?

Yes just traverse through the array and form the tree

No we need one more traversal to form a tree

No in case of sparse trees

Yes by using both inorder and array elements

MULTIPLE CHOICE QUESTION

1 min • 1 pt

If the tree is not a complete binary tree then what changes can be made for easy access of children of a node in the array?

every node stores data saying which of its children exist in the array

no need of any changes continue with 2w and 2w+1, if node is at i

keep a seperate table telling children of a node

use another array parallel to the array with tree

MULTIPLE CHOICE QUESTION

1 min • 1 pt

How many children does a binary tree have?

any number of children

0 or 1 or 2

0 or 1

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Continue with Google

Continue with Email

Continue with Microsoft

or continue with

Facebook

Apple

Others

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

Already have an account?

Similar Resources on Wayground

25 questions

Technical Skills- End Examin - 13-01-2024 ECE & EEE SEM V

Quiz

•

Professional Development

25 questions

STEP 4 (GFK)

Quiz

•

4th Grade - Professio...

25 questions

Pre-Intermediate Vocabulary

Quiz

•

8th Grade - Professio...

25 questions

INT present simple and present continuous

Quiz

•

Professional Development

25 questions

CAUSATIVE VERBS 2

Quiz

•

Professional Development

27 questions

ADVANCED GRAMMAR (1)

Quiz

•

Professional Development

25 questions

Literary Genres

Quiz

•

Professional Development

25 questions

Placement Test - Cambridge

Quiz

•

KG - Professional Dev...

Popular Resources on Wayground

10 questions

Safety Day 2026 – Student Review

Quiz

•

9th Grade

21 questions

Continents and Oceans

Quiz

•

6th Grade

20 questions

Parts of Speech

Quiz

•

5th Grade

16 questions

Subject & Predicate

Quiz

•

5th Grade

25 questions

Multiplication Facts

Quiz

•

5th Grade

12 questions

Map Skills

Quiz

•

3rd Grade

22 questions

Continents and Oceans

Quiz

•

5th Grade

15 questions

Rounding Decimals

Quiz

•

5th Grade

Discover more resources for English

10 questions

How to Email your Teacher

Quiz

•

Professional Development

30 questions

Communication On The Job - Midterm Prep

Quiz

•

Professional Development

20 questions

Block Buster Movies

Quiz

•

10th Grade - Professi...

CPS02-Day3-NWC -Set02

What is the traversal strategy used in the binary tree?

What are the children for node ‘w’ of a complete-binary tree in an array representation?

Consider a situation of writing a binary tree into a file with memory storage efficiency in mind, is array representation of tree is good?

What is the parent for a node ‘w’ of a complete binary tree in an array representation when w is not 0?

Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?

If the tree is not a complete binary tree then what changes can be made for easy access of children of a node in the array?

How many children does a binary tree have?

What is/are the disadvantages of implementing tree using normal arrays?

What must be the ideal size of array if the height of tree is ‘l’?

Level order traversal of a tree is formed with the help of

Access all questions and much more by creating a free account

Similar Resources on Wayground

Popular Resources on Wayground

Discover more resources for English