Question

The depth of a complete binary tree is given by

a.

Dn = n logn+1

b.

Dn = logn

c.

Dn = logn+1

d.

Dn = n logn

Posted under Trees Data Structures and Algorithms

Answer: (c).Dn = logn+1

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The depth of a complete binary tree is given by

Add Comment

Similar Questions

Discover Related MCQs

Q. When representing any algebraic expression E which uses only binary operations in a 2-tree,

View solution

Q. A binary tree can easily be converted into a 2-tree

View solution

Q. When converting binary tree into extended binary tree, all the original nodes in binary tree are

View solution

Q. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal

View solution

Q. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called

View solution

Q. The in order traversal of tree will yield a sorted listing of elements of tree in

View solution

Q. In a Heap tree

View solution

Q. Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are:

Note: The height of a tree with a single node is 0.

View solution

Q. Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is _____.

View solution

Q. B Trees are generally

View solution

Q. If a node having two children is deleted from a binary tree, it is replaced by its

View solution

Q. A full binary tree with 2n+1 nodes contain

View solution

Q. If a node in a BST has two children, then its inorder predecessor has

View solution

Q. A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as

View solution

Q. A full binary tree with n leaves contains

View solution

Q. The number of different directed trees with 3 nodes are

View solution

Q. One can convert a binary tree into its mirror image by traversing it in

View solution

Q. A B-tree of minimum degree t can maximum _____ pointers in a node.

View solution

Q. A BST is traversed in the following order recursively: Right, root, left. The output sequence will be in

View solution

Q. The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum

View solution

View All MCQs on Trees

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

Digital Logic Design

Understand the foundation of digital computers with our Digital Logic Design MCQs....

Hadoop

Dive into the world of big data with our Hadoop MCQs. Cover key concepts including...

Artificial Intelligence

Get started on the path to the future with our Artificial Intelligence MCQs. Covering...

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...

Visual Basic

Enhance your knowledge of Microsoft's event-driven programming language with our...

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

Digital Image Processing (DIP)

Delve into the techniques of enhancing digital images with our Digital Image...