Quiz-1

Question 1

Time: 00:00:00
The no of external nodes in a full binary tree with n internal nodes is?

n

n

n+1

n+1

2n

2n

2n + 1

2n + 1

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 2

Time: 00:00:00
The difference between the external path length and the internal path length of a binary tree with n internal nodes is?

1

1

n

n

n + 1

n + 1

2n

2n

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 3

Time: 00:00:00
Which of the following statement about binary tree is CORRECT?

Every binary tree is either complete or full

Every binary tree is either complete or full

Every complete binary tree is also a full binary tree

Every complete binary tree is also a full binary tree

Every full binary tree is also a complete binary tree

Every full binary tree is also a complete binary tree

A binary tree cannot be both complete and full

A binary tree cannot be both complete and full

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 4

Time: 00:00:00
Which type of traversal of binary search tree outputs the value in sorted order?

Pre-order

Pre-order

In-order

In-order

Post-order

Post-order

None

None

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 5

Time: 00:00:00
If a node having two children is to be deleted from binary search tree, it is replaced by its

In-order predecessor

In-order predecessor

In-order successor

In-order successor

Pre-order predecessor

Pre-order predecessor

None

None

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 6

Time: 00:00:00
The number of edges from the root to the node is called __________ of the tree.

Height

Height

Depth

Depth

Length

Length

None of the mentioned

None of the mentioned

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 7

Time: 00:00:00
The number of edges from the node to the deepest leaf is called _________ of the tree.

Height

Height

Depth

Depth

Length

Length

None of the mentioned

None of the mentioned

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 8

Time: 00:00:00
What is a full binary tree?

Each node has exactly zero or two children

Each node has exactly zero or two children

Each node has exactly two children

Each node has exactly two children

All the leaves are at the same level

All the leaves are at the same level

Each node has exactly one or two children

Each node has exactly one or two children

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

A full binary tree is defined as a binary tree in which all nodes have either zero or two child nodes.

Start

Question 9

Time: 00:00:00
What is a complete binary tree?

Each node has exactly zero or two children

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 binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left

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

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

None of the mentioned

None of the mentioned

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 10

Time: 00:00:00
What is the time complexity for finding the height of the binary tree?

h = O(loglogn)

h = O(loglogn)

h = O(nlogn)

h = O(nlogn)

h = O(n)

h = O(n)

h = O(log n)

h = O(log n)

Good Job!

Oops!

  • PrepInsta Explanation
  • User Explanation
Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

["0","40","60","80","100"]
["Need more practice!","Keep trying!","Not bad!","Good work!","Perfect!"]
×

Please login to report

Personalized Analytics only Availble for Logged in users

Analytics below shows your performance in various Mocks on PrepInsta

Your average Analytics for this Quiz

Rank

-

Percentile

0%

Start Preparing
Detailed performance

Completed

0/10

Accuracy

0%

Related Banners
prepinsta
prepinsta
Prepinsta Prime
Get Prepinsta Prime

Get all 200+ courses offered by Prepinsta

Explore Prime or check Course List
Check out our instagram

Never Miss an OffCampus Update

Get OffCampus Updates on Social Media from PrepInsta

Follow us on our Media Handles, we post out OffCampus drives on our Instagram, Telegram, Discord, Whatsdapp etc.

Instagram Whatsapp Telegram Linkedin
Get Hiring Updates
Amazon,Google,Delottie & 30+companies are hiring ! Get hiring Updates right in your inbox from PrepInsta
prepinsta
prepinsta
prepinsta
prepinsta

Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others.
Get Prime Course List

Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others.
Get Prime Course List

Get PrepInsta Prime Subscription

Get access to all the courses that PrepInsta offers, check the out below -

Companies

TCS, Cognizant, Delloite, Infosys, Wipro, CoCubes, KPMG, Amazone, ZS Associates, Accenture, Congnizant & other 50+ companies

See Full list here
Get Prime

Programming

Data Structures, Top 500 Codes, C, C++, Java Python & other 10+ subjects

See Full list here
Get Prime

Skills

Full Stack Web Development, Data Science, Machine Learning, AWS Cloud, & other 10+ skills and 20+ projects

See Full list here
Get Prime

Related Pages

L&T Infotech Syllabus

L&T Infotech Aptitude Questions

L&T Infotech Logical Ability

L&T Infotech Verbal Ability

L&T Infotech Computer Programming

L&T Infotech Coding Questions

October 10, 2019