Question

1. As it pertains to Data Structures what is a Tree, in general, and particular what a Binary Tree is.

2. Be able to construct a Binary Tree from an arithmetic expression such as: 4 * 5 – 6 / 8 + 2

Answer #1

TREE

- Tree is a hierarchical data structure which stores the information naturally in the form of hierarchy style.
- Tree is one of the most powerful and advanced data structures.
- It is a non-linear data structure compared to arrays, linked lists, stack and queue.
- It represents the nodes connected by edges.

Binary Tree

A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.

A Binary Tree node contains following parts.

- Data
- Pointer to left child
- Pointer to right child

What is the output of the Euler tour in the normal binary
search tree if the key insert order is 5 , 2 , 8 , 5 , 9 , 5 , 1 ,
3 , 4 , 2 , 8 ? All keys equal to the node should be the right
subtree of that node.
____________________________________________________________
Construct the binary max - heap for the keys given below. Once
all the keys are inserted, perform the remove maximum operation,
and...

Construct a Binary Search Tree using the following
data: (5 pts)
54
37
47
28
44
71
40
60
(Make sure to show dummy nodes)
b) Illustrate how will you search for V = 39 from the
above tree and how many searches will be needed. (5
pts)
c) Illustrate how you will delete the root from the
above tree, redraw the tree after deletion. (5 pts). Redraw the
tree.

1. What is the general strategy used by organisms to ensure all
adult structures are generated in the correct locations? Explain
how it works.
2. I predict that changes in cadherin expression are important
for organ formation. Why might I predict that?
3. Explain how the nervous system is formed include general
strategies used to pattern the developing vertebrate nervous system
and ensure all the correct neurons are generated.

Consider this binary search tree:
14
/ \
2 16
/ \
1 5
/
4
Suppose we remove the node with value 2. What will be the new
tree?
14
/ \
4 16
/ \
1 5
14
/ \
5 16
/ \
1 4
4
/ \
5 16
/ /
1 14
14
/ \
Null 16
/ \
1 5
/
4

#data structures
Give the infix form of the following postfix expression.
1 A B C + * D - E F + K - +
Give the postfix form of the following infix expression.
2 ( A + B ) * ( C - D + E )

Put these integers into a binary search tree and then state the
output of a postorder traversal.
Put EXACTLY ONE SPACE between each integer, so your output looks
like this:
1 2 3 4 5
These are the integers to put into the tree:
41 17 80 25 8 11 50 60 100
Output: ____

Put these integers into a binary search tree and then state the
output of a preorder traversal.
Put EXACTLY ONE SPACE between each integer, so your output looks
like this:
1 2 3 4 5
These are the integers to put into the tree:
41 17 80 25 8 11 50 60 100
Output: ____

In C++ please.
8. Explain what insert_iterator and inserter() function is.
Given the following data structures:
vector<int> v1 = {1, 2, 3, 4, 5};
vector<int> v2;
Explain the problem with the below code and fix it with inserter()
function.
copy(v1.begin(), v1.end(), v2.begin());

The following data represent the number of potholes on 35
randomly selected 1-mile stretches of highway around a particular
city. Construct a frequency table, a relative frequency table,
and a bar graph for the data.
Number of Potholes
1
4
3
1
3
7
5
1
3
6
1
2
1
1
2
7
1
6
2
7
1
5
4
4
1
1
5
3
5
2
3
2
7
1
3
Construct a frequency table for the data....

Giving an array of integers A[1:8] ={5, 1, 3, 2, 7, 6, 8,
4}.
Build a MAX-HEAP on A. Show the steps using binary tree
representation or array view.
Use heap sort: show the array after the first, the second, and
the third of heap sort

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 12 minutes ago

asked 27 minutes ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 2 hours ago

asked 2 hours ago

asked 2 hours ago

asked 2 hours ago

asked 3 hours ago

asked 3 hours ago

asked 3 hours ago