Question

You are again to draw two sets of binary search trees. You may produce these drawings in any way you wish but each set must be placed into a Word of PDF document for submission. In other words, don't submit an image file. Embed the images into a document and submit that. Make sure your name appears clearly on the both documents! Not doing so will cost 5 points. Draw left-leaning red-black trees You are to draw the left-leaning red-black trees that result after inserting each of the following keys in the order given: "TCG", "TAC", "AAC", "TGG", "TTC", "ACC", "GGC". You will draw a total of 7 trees, one after each insertionand any work needed to make the tree a legal left-leaning red-black tree. The name of this document must be treedrawingsLLRB.{doc,docx,pdf}.​

Answer 1

Answer:

You are again to draw two sets of binary search trees. You may produce these drawings in any way you wish but each set must be placed into a Word of PDF document for submission. In other words, don't submit an image file. Embed the images into a document and submit that. Make sure your name appears clearly on the both documents! Not doing so will cost 5 points.

Draw 2-3 trees

You are to draw the 2-3 trees that result after inserting each of the following keys in the order given: "TCG", "TAC", "AAC", "TGG", "TTC", "ACC", "GGC". You will draw a total of 7 trees, one after each insertion and any work needed to make the tree a legal 2-3 tree. The name of this document must be treedrawings23.{doc,docx,pdf}.