ENG502 Midterm MCQs Solved Aslam u alaikum dear students. If you are looking for Important ENG502 Midterm MCQs Solved you are v is i ting the right website. I provided the perfect solution here according to my efforts. If there is any mistake then please correct it to get good grades in your Midterm and Final Term exams. Please verify the answers of all questions before remembering them for your Midterm and Final Term exams.

**JOIN OUR SOCIAL MEDIA GROUPS **

**Also check below Past Papers: **

- There may be situations where the data in our programs or applications is not in

linear order. There is a relationship between the data that cannot be captured by a - linked list or other linear data structure. Here we need a data structure like a tree.

In some applications, searching linear data structures is very tedious. Assume - we want to look up a name in a phone book that has 100,000 entries. If this

ENG502 Midterm MCQs Solved

- directory is a linked list, we will have to traverse the list from the beginning

position. On average, we have to go through half the directory to find a name. We - may not find the desired name in the entire directory even though the entire directory is traversed

list. Therefore, it would be better to use a data structure to make the lookup operation happen - it won’t take much time. Considering such applications, we will now talk about a
- a special tree data structure known as a binary tree.

ENG502 Midterm MCQs Solved

**Binary tree**- The mathematical definition of a binary tree is
- “A binary tree is a finite set of elements that is either empty or partitioned into three

disjoint subsets. The first subset contains a single element called the root of the tree. - The other two subsets are themselves binary trees called the left and right subtrees’.
- Each element of a binary tree is called a tree node.

The following figure shows a binary tree.