DAT 305 Wk 3 Discussion – Binary Search Tree

0 items
DAT 305 Wk 3 Discussion - Binary Search Tree
DAT 305 Wk 3 Discussion – Binary Search Tree
$3.00
Go to the store page
  • Description

DAT 305 Wk 3 Discussion – Binary Search Tree

Post a total of 3 substantive responses over 2 separate days for full participation. This includes your initial post and 2 replies to classmates or your faculty member.

Due Thursday

Respond to the following in a minimum of 175 words:

Another important property of a binary search tree is being able to easily find the maximum and minimum key in the tree. Discuss a simple rule to identify these keys. What is the output of a BFS traversal in a normal binary search tree if the key insert order is “1,2,3,4,5,6,7”?

OR

Explain the benefits a recursive algorithm can provide. What are the negative aspects of using recursion?

Due Monday

Post 2 replies to classmates or your faculty member. Be constructive and professional.