Question

1)

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: ____

2)

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: ____

3)

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: ____

4)

Adding an element ( a node) to a binary search tree in general is O( )

Group of answer choices

n

log n

nlogn

n * n

5)

Deleting an element ( a node) from a binary search tree in general is O( )

Group of answer choices

n

log n

nlogn

n*n

6)

Searching for an element in a binary search tree (in general) is O( )

Group of answer choices

n

logn

nlogn

n*n

Answer 1