DAT 305 Wk 4 Discussion - Binary Search Trees

Click Here To Download Your Files :

http://www.onlinehelp123.com/dat-305

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

You can buy more tutorials from the below link

http://www.onlinehelp123.com/dat-305

DAT 305 Wk 4 Discussion - Binary Search Trees

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 Day 3

Respond to the following in a minimum of 175 words: 

An 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"? When do you struggle with finding the max and min key in the tree? 

Due Day 7

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