- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Trees
- What is the average case time complexity...

Q. |
## What is the average case time complexity for finding the height of the binary tree? |

A. | h = O(loglogn) |

B. | h = O(nlogn) |

C. | h = O(n) |

D. | h = O(log n) |

Answer» D. h = O(log n) |

View all MCQs in:
Data Structures (DS)

- 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___________.
- The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
- A binary tree of depth "d" is an almost complete binary tree if __________.
- What is the average case time complexity of binary search using recursion?
- What are the worst case and average case complexities of a binary search tree?
- In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.
- The minimum height of self balancing binary search tree with n nodes is
- Why we need to a binary tree which is height balanced?
- 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?

Login to Continue

It will take less than 2 minutes

Report MCQ