DATA STRUCTURE AND ALGORITHM : TREE

2. Draw the expression tree for the following expression: (C+D+A*B) * (E+F) Answer all the questions based on the binary tree below. 11.2 Exercises Exercise 1 D B H F E G Root Node Child of node HT Parent of node E Ancestors of node I Descendents of node D Leaf nodes Heigth of the tree Degree of the three Degree of node 1 Level of node G Balance Tree(T/F) Exercise 2 Based on the binary tree given, perform each type of traversal stated below B E D F G H Inorder Traversal Preorder Traversal Postorder Traversal Breadth First Traversal Depth First Traversal Exercise 4 Draw a Binary Search Tree for the given data. Take 33 as the root node value. 80, 70, 66, 56, 33, 23, 14, 10, 7 Remove node 33 and 7 from the Binary Search Tree above