Q. Spanning trees have a special class of depth-first search trees named _________

View solution

Q. Prefix expression can be evaluated _________

View solution

Q. What is the postfix expression of the given expression, (2*4-(5+7/3^4)-8)10?

View solution

Q. Convert the following expression into prefix notation.

(g-(f^e/d+c)-ba)

View solution

Q. What is the postfix expression of (A+B)-C*(D/E))+F?

View solution

Q. What is the postfix expression of 9+3*5/(10-4)?

View solution

Q. Conversion from prefix to postfix expression can be done _______________

View solution

Q. Infix to prefix conversion can be done using __________

View solution

Q. What is the output of the following if funct1(7)?

View solution

Q. Evaluation of 4*5+3/2-9 in prefix notation.

View solution

Q. Evaluation of expression a/b+c*d-e in postfix notation.

View solution

Q. Worst case complexity of Breadth First Search traversal __________

View solution

Q. Breadth First Search traversal of a binary tree finds its application in __________

View solution

Q. An immediate application of a Depth First Search traversal is __________

View solution

Q. The time complexity of calculating the sum of all leaf nodes in an n-order binary tree is __________

View solution

Q. For the expression (7-(4*5))+(9/3) which of the following is the post order tree traversal?

View solution

Q. From the following code identify the which traversal of a binary tree is this __________
function traversal(node)

{
//Input:root node of the tree
//Output:None
visitLeft(node)
//if node has left child
traversal(node.left)
visit_Below(node)
//if node has right child
traversal(node.right)
visitRight(node)
}

View solution

Q. What is the minimum height for a binary search tree with 60 nodes?

View solution

Q. From the following code identify the which traversal of a binary tree is this __________

//if node has left child
order(node.left)
//if node has right child
order(node.right)
visit(node)

View solution

Q. An important application of binary tree is ______

View solution