Skip to content

CSE2133 - Discrete Mathematics

Trees

Term 161

  • Q6(a): Write down the different properties of tree.
  • Q6(b): Represent the expression \(((x+y)^2)*((x-4)/3)\) using binary tree.
  • Q6(c): Write down the preorder, inorder and post order traversal for the given tree.

Ordered rooted tree

Term 171

  • Q7(a) [5]: Form a binary search tree for the words mathematics, physics, geography, zoology, meteorology, geology, psychology and chemistry (using alphabetic order).
  • Q7(b) [5]: Perform the in-order, pre-order and post-order traversal in the given tree.

Ordered rooted tree

  • Q7(c) [4]: What is the value of the postfix expression 7 2 3 * - 4 ↑ 9 3 / +?

Term 181

  • Q7(b): In which order does a post-order traversal, in-order traversal, pre-order traversal list the vertices in the ordered rooted tree shown?

Ordered rooted tree

  • Q7(c): Evaluate the expression: 3 2 * 2 ↑ 5 3 - 8 4 / * -.

Term 191

  • Q6(c) [6]: Given a memory representation of binary tree as follows. Root=2; Avail=4. (i) Draw the diagram of the tree. (ii) Find the preorder, in-order and post-order traversals.

Memory representation of binary tree

Term 201

  • Q4(a) [4]: Represent the following algebraic representation using binary tree: \(((a+b)(c+d))-(e+f)/h+g\).
  • Q4(b) [4+9]: Given a memory representation of binary tree as shown. Root=2; Avail=4. (i) Draw the diagram of the tree. (ii) Find the preorder, in-order and post-order traversals.

Memory representation of binary tree

  • Q7(c) [4]: Evaluate the expressions: (i) + - * 2 3 5 / % 2 3 4; (ii) 7 2 3 * - 4 ↑ 9 3 / +.

Term 211

  • Q5(b) [6]: Using tree diagram find the four-bit binary numbers without consecutive 0's.
  • Q7(a) [4]: Represent the following algebraic representation using binary tree: \(((a+b)c+d)-(e+f)/h+g\).
  • Q7(b) [6]: Given the memory representation of binary tree as shown. Root=2; Avail=4. (i) Draw the diagram of the tree. (ii) Find the preorder, in-order and post-order traversals.

Memory representation of binary tree