Which of the following tree data structures is not a balanced binary tree?

Hi Guest

MobileUser

HomePage

Jobs

WalkIn

Articles

:) Latest Topic

AJAX

VB.NET

SQL Query

UDDI

CLASS

JavaScript Questions

SharePoint Interview

SilverLight

WCF

general knowledge

ASP.NET

:) Hot Jobs

:) Latest Articles

Which of the following tree data structures is not a balanced binary tree?
Question Posted on 14 Feb 2024

Home >> Programming Languages >> Data Structure MCQ >> Which of the following tree data structures is not a balanced binary tree?

Which of the following tree data structures is not a balanced binary tree?
Choose the correct option from below list
(1)Splay tree
(2)B-tree
(3)AVL tree
(4)Red-black tree

Answer:-(2)B-tree
Note:-All the tree data structures given in options are balanced, but B-tree can have more than two children.

	0
	0


Input Your Comments Or suggestions(If Any)
Name
Email		(optional)
Comments

Other Important Questions

Which of the following data structure can provide efficient searching of the elements?

What do you mean by a data structure?

What are the disadvantages of arrays?

Which data structure is used for implementing recursion?

The data structure required to check whether an expression contains a balanced parenthesis is?

Top Searches:asp net questions vb net questions sql query uddl questions class javascript Questions sharepoint interview questions and concept silverlight questions and concept wcf questions beans general knowledge ajax questions

PHP | Biztalk | Testing | SAP | HR |

Privacy policy | Terms and Conditions | Blog

If the copyright of any questions or content or syntax belong to you email us we will remove that(info@crackyourinterview.com or crackyourinterview2018@gmail.com)