What is the depth of the root node of the ternary tree?(a) 2(b) 1(c) 0(d) 3I'm obligated to ask this question of 1 topic in section Trees of Data Structures & Algorithms IThe question was asked in unit test.

What is the depth of the root node of the ternary tree?(a) 2(b) 1(c) 0

1.	What is the depth of the root node of the ternary tree?(a) 2(b) 1(c) 0(d) 3I'm obligated to ask this question of 1 topic in section Trees of Data Structures & Algorithms IThe question was asked in unit test.
Answer» The correct answer is (c) 0 Easiest EXPLANATION - DEPTH is defined as the LENGTH of the path from ROOT to the node. So the depth of root node in ternary tree is 0.

Discussion

No Comment Found

Related InterviewSolutions

In an expression tree algorithm, what happens when an operand is encountered?(a) create one node pointing to a stack(b) pop the nodes from the stack(c) clear stack(d) merge all the nodesThis key question is from Trees in portion Trees of Data Structures & Algorithms II had been asked this question in my homework.
What is the postfix expression for the following expression tree?(a) abcde++**(b) ab+cde+**(c) abc+de+**(d) abcd+*e+*This question is from Trees in portion Trees of Data Structures & Algorithms IThis question was posed to me in an international level competition.
An expression tree’s nodes can be deleted by calling?(a) malloc(b) calloc(c) delete(d) freeOrigin of the question is Trees topic in division Trees of Data Structures & Algorithms II have been asked this question in examination.
++a*bc*+defg is an?(a) postfix expression(b) infix expression(c) prefix expression(d) invalid expressionThe origin of the question is Trees in division Trees of Data Structures & Algorithms IThis question was addressed to me in homework.
An expression tree is created using?(a) postfix expression(b) prefix expression(c) infix expression(d) paranthesized expressionThis is a very interesting question from Trees in portion Trees of Data Structures & Algorithms IThis question was posed to me in an interview for internship.
Only infix expression can be made into an expression tree.(a) true(b) falseThe doubt is from Trees in portion Trees of Data Structures & Algorithms II had been asked this question in an online interview.
The average depth of a binary tree is given as?(a) O(N)(b) O(log N)(c) O(M log N)(d) O(√N)This question is from Trees topic in section Trees of Data Structures & Algorithms IThis question was posed to me during an interview.
The expression obtained by recursively producing a left expression, followed by an operator, followed by recursively producing a right expression is called?(a) prefix expression(b) infix expression(c) postfix expression(d) paranthesized expressionMy query is from Trees topic in portion Trees of Data Structures & Algorithms IThis question was addressed to me in examination.
An expression tree is a kind of?(a) Binary search tree(b) Fibonacci tree(c) Binary tree(d) TreapI'd like to ask this question from Trees in division Trees of Data Structures & Algorithms IThis question was posed to me in a job interview.
What does the other nodes of an expression tree(except leaves) contain?(a) only operands(b) only operators(c) both operands and operators(d) expressionMy question is taken from Trees topic in division Trees of Data Structures & Algorithms II have been asked this question during an interview for a job.

What is the depth of the root node of the ternary tree?(a) 2(b) 1(c) 0(d) 3I'm obligated to ask this question of 1 topic in section Trees of Data Structures & Algorithms IThe question was asked in unit test.

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment