Q. In a binary search tree, which of the following traversals would print the numbers in the ascending order?

View solution

Q. The number of edges from the root to the node is called __________ of the tree.

View solution

Q. The number of edges from the node to the deepest leaf is called _________ of the tree.

View solution

Q. What is a full binary tree?

View solution

Q. What is a complete binary tree?

View solution

Q. What is the time complexity for finding the height of the binary tree?

View solution

Q. Which of the following is not an advantage of trees?

View solution

Q. In a full binary tree if number of internal nodes is I, then number of leaves L are?

View solution

Q. In a full binary tree if number of internal nodes is I, then number of nodes N are?

View solution

Q. In a full binary tree if there are L leaves, then total number of nodes N are?

View solution

Q. Which of the following is correct with respect to binary trees?

View solution

Q. Which of the following is false about a binary search tree?

View solution

Q. What is the speciality about the inorder traversal of a binary search tree?

View solution

Q. What are the worst case and average case complexities of a binary search tree?

View solution

Q. What are the conditions for an optimal binary search tree and what is its advantage?

View solution

Q. What is an AVL tree?

View solution

Q. Why we need to a binary tree which is height balanced?

View solution

Q. What is the maximum height of an AVL tree with p nodes?

View solution

Q. To restore the AVL property after inserting a element, we start at the insertion point and move towards root of that tree. is this statement true?

View solution

Q. Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?

View solution