Question 41 : Can child node be always called Leaf node in the ternary tree?
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 42 : What is the worst-case running time of unions done by size and path compression?
1. O(N)
2. O(log * N)
3. O(N log N)
4. O(M log* N)
View Answer   Discuss with Members

Question 43 : Which of the following is the name of the node having child nodes?
1. Brother
2. Sister
3. Mother
4. Parent
View Answer   Discuss with Members

Question 44 : An expression tree is created using?
1. postfix expression
2. prefix expression
3. infix expression
4. paranthesized expression
View Answer   Discuss with Members

Question 45 : Insertion into a 2-d tree is a trivial extension of insertion into a binary search tree.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 46 : What does the other nodes of an expression tree(except leaves) contain?
1. only operands
2. only operators
3. both operands and operators
4. expression
View Answer   Discuss with Members

Question 47 : What is the worst case efficiency for a path compression algorithm?
1. O(N)
2. O(log N)
3. O(N log N)
4. O(M log N)
View Answer   Discuss with Members

Question 48 : What is the time taken for a range query for a perfectly balanced tree?
1. O(N)
2. O(log N)
3. O(√N+M)
4. O(√N)
View Answer   Discuss with Members

Question 49 : ++a*bc*+defg is an?
1. postfix expression
2. infix expression
3. prefix expression
4. invalid expression
View Answer   Discuss with Members

Question 50 : An expression tree's nodes can be deleted by calling?
1. malloc
2. calloc
3. delete
4. free
View Answer   Discuss with Members