Draw the following operations and provide the Big-O analysis for each operation.

• insert into an empty tree
• insert into a well balanced tree
• insert into an extremely poorly balanced tree
• delete an element
  • Delete a leaf node
  • Delete a node with two children
• search

Do this in Visio or some drawing application, and turn in a pdf of your drawings.

Answer rating: 100% (QA)

Insert into an empty tree Operation When inserting into an empty tree its a straightforward process of adding the new element as the root node BigO An... View the full answer