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

Q. What maximum difference in heights between the leafs of a AVL tree is possible?

View solution

Q. Why to prefer red-black trees over AVL trees?

View solution

Q. What is a Cartesian tree?

View solution

Q. Which of the below statements are true:

i.Cartesian tree is not a height balanced tree

ii.Cartesian tree of a sequence of unique numbers can be unique generated

View solution

Q. What is the speciality of cartesian sorting?

View solution

Q. Consider a sequence of numbers to have repetitions, how a cartesian tree can be constructed in such situations without violating any rules?

View solution

Q. After applying the below operations on a input sequence, what happens?

i. construct a cartesian tree for input sequence

ii. put the root element of above tree in a priority queue

iii. if( priority queue is not empty) then

.search and delete minimum value in priority queue

.add that to output

.add cartesian tree children of above node to priority queue

View solution