S HRI R AMSWAROOP M EMORIAL C OLLEGE O F E NGG. & M ANAGEMENT B.Tech. [SEM IV (EC & EI All groups)] QUIZ TEST-3 (Session : 2015-16) DATA STRUCTURES USING ‘C’ (NEC-401) Roll No. (To be filled by the Student) Note: 1.Attempt all questions. Part – A (Questions from Tutorial Sheet 1) Q.1 Write a C function that will count all nodes of a linked binary tree. [Q3] [5M] Q.2 Define the following: (a) Tree (b) Height of a node (c) Forest (d) Depth (e) Binary tree. [Q12] [5M] Part – B [20 Marks] Q.1 Attempt all short answer type questions. [5 x 1 =5M] (a) Consider the node of a complete binary tree whose value is stored in data[i] for an array implementation. If this node has a right child, where will the right child's value be stored? (b) What is the minimum number of nodes in a complete binary tree with depth 3? (c) List out few of the Application of tree data-structure?
You've reached the end of your free preview.
Want to read the whole page?
- Fall '19
- Tree traversal