Q. Which of the following is an application of Red-black trees and why?

View solution

Q. When it would be optimal to prefer Red-black trees over AVL trees?

View solution

Q. Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?

View solution

Q. How can you save memory when storing color information in Red-Black tree?

View solution

Q. When to choose Red-Black tree, AVL tree and B-trees?

View solution

Q. After the insertion operation, is the resultant tree a splay tee?

View solution

Q. What is inefficient with the below threaded binary tree picture?

View solution

Q. If we implement heap as min-heap , deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.

View solution

Q. If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree . What value will be at leaf nodes of the right subtree of the heap.

View solution

Q. Binary trees can have how many children?

View solution

Q. Disadvantage of using array representation for binary trees is?

View solution

Q. What must be the ideal size of array if the height of tree is ‘l’?

View solution

Q. What are the children for node ‘w’ of a complete-binary tree in an array representation?

View solution

Q. What is the parent for a node ‘w’ of a complete binary tree in an array representation when w is not 0?

View solution

Q. If the tree is not a complete binary tree then what changes can be made for easy access of children of a node in the array ?

View solution

Q. Consider a situation of writing a binary tree into a file with memory storage efficiency in mind, is array representation of tree is good?

View solution

Q. Why is heap implemented using array representations than tree(linked list) representations though both tree representations and heaps have same complexities?

for binary heap

-insert: O(log n)

-delete min: O(log n)

for a tree

-insert: O(log n)

-delete: O(log n)

Then why go with array representation when both are having same values ?

View solution

Q. Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?

View solution

Q. Advantages of linked list representation of binary trees over arrays?

View solution

Q. Disadvantages of linked list representation of binary trees over arrays?

View solution