Binary Search Trees (10 points, about 1 point per question) Tree A Tree B XXXXXXXXXX 42 12 Thank tos https://www.tutorialspoint.com/ data structures aleorith ms/binary search tree.htm. 2 Thanks to...

Binary Search Trees (10 points, about 1 point per question) Tree A Tree B 8 14 35 11 10 19 31 42 12 Thank tos https://www.tutorialspoint.com/ data structures aleorith ms/binary search tree.htm. 2 Thanks to http5://www.cs.cmu.edu/adamchik/15- 121/lectures/Trees/trees.html Tree C Tree D 25 36 10 (30 40 22 (28 38 48 50 Thanks to https://www.cs.cmu.edu/adamchik/15- 121/lectures/Trees/trees.html Thanks to: http://btechsmartclass.com/DS/US T1.html 1.1. Is tree a binary search tree? If not, which property of BSTs does it fail? 1.2. Why is tree B not a binary search tree? Which property of BSTs does it fail? 1stree C.binacyseatch tree? If not, which property of BSTS does it fail? 14lstree Dbinary.search tree? If not, which property of BSTS does it fail? 1.5. If we were searching tree A for the value 15, which node would get checked first? W 1.6. If we were searching tree D for the value 13, what path of nodes would we follow? (Four nodes, 4 points) W