Trees on Data Structure and Algorithms related Questions and Answers - Page 7

Question 61 : Which operation find the value associated with a given key?
1. Insert
2. Find Next
3. Look up
4. Delete
View Answer   Discuss with Members

Question 62 : Several kinds of queries are possible on a k-d called as?
1. partial queries
2. range queries
3. neighbour queries
4. search queries
View Answer   Discuss with Members

Question 63 : When executing a sequence of Unions, a node of rank r must have at least 2r descendants.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 64 : In a two-dimensional search tree, the root is arbitrarily chosen to be?
1. even
2. odd
3. depends on subtrees
4. 1
View Answer   Discuss with Members

Question 65 : Only infix expression can be made into an expression tree.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 66 : In the Union/Find algorithm, the ranks of the nodes on a path will increase monotonically from?
1. leaf to root
2. root to node
3. root to leaf
4. left subtree to right subtree
View Answer   Discuss with Members

Question 68 : Which one of the following is the correct formulae to find the parent node at index I?
1. (I-1)/K
2. (I+1)/K
3. (I*1)/K
4. (I-2)/K
View Answer   Discuss with Members

Question 69 : Which type of tree does Van Emde Boas require to perform basic operations?
1. Unbalanced
2. Balanced
3. Complete
4. Non – Binary
View Answer   Discuss with Members

Question 70 : The leaves of an expression tree always contain?
1. operators
2. operands
3. null
4. expression
View Answer   Discuss with Members


View 61 - 70 of 93 Questions

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter