McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2024
→
Computer Science Engineering (CSE)
→
Data Structures (DS)
→
Non Linear Data Structures - Trees
→
The average depth of a binary tree is gi...
Q.
The average depth of a binary tree is given as?
A.
O(N)
B.
O(√N)
C.
O(N2)
D.
O(log N)
Answer» D. O(log N)
1.3k
0
Do you find this helpful?
12
View all MCQs in
Data Structures (DS)
Discussion
No comments yet
Login to comment
Related MCQs
Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
A binary tree of depth "d" is an almost complete binary tree if __________.
The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
The depth of a complete binary tree is given by__________.
In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.
A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?
Which of the following pair’s traversals on a binary tree can build the tree uniquely?
The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree?
An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by