Expression Tree MCQ

Test your knowledge with important Expression Tree MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Expression Tree MCQs at Bissoy

• In an expression tree algorithm, what happens when an operand is encountered?
  ক

  create one node pointing to a stack

  খ

  pop the nodes from the stack

  গ

  clear stack

  ঘ

  merge all the nodes
• What is the postfix expression for the following expression tree?
  ক

  abcde++**

  খ

  ab+cde+**

  গ

  abc+de+**

  ঘ

  abcd+*e+*
• An expression tree’s nodes can be deleted by calling?
  ক

  malloc

  খ

  calloc

  গ

  delete

  ঘ

  free
• ++a*bc*+defg is an?
  ক

  postfix expression

  খ

  infix expression

  গ

  prefix expression

  ঘ

  invalid expression
• An expression tree is created using?
  ক

  postfix expression

  খ

  prefix expression

  গ

  infix expression

  ঘ

  paranthesized expression
• Only infix expression can be made into an expression tree.
  ক

  true

  খ

  false
• The expression obtained by recursively producing a left expression, followed by an operator, followed by recursively producing a right expression is called?
  ক

  prefix expression

  খ

  infix expression

  গ

  postfix expression

  ঘ

  paranthesized expression
• An expression tree is a kind of?
  ক

  Binary search tree

  খ

  Fibonacci tree

  গ

  Binary tree

  ঘ

  Treap
• What does the other nodes of an expression tree(except leaves) contain?
  ক

  only operands

  খ

  only operators

  গ

  both operands and operators

  ঘ

  expression
• A node can have a minimum of one child.
  ক

  true

  খ

  false
• The leaves of an expression tree always contain?
  ক

  operators

  খ

  operands

  গ

  null

  ঘ

  expression