Using the knowledge of how elements are inserted into a tree…

Using the knowledge of how elements are inserted into a tree, write down the original numbers in sequence. For eg.. “80, 20, 33, 23, 56…. etc”. (5 pts) Is this a balanced tree? (Yes or No). (2.5 pts) Is this a complete tree? (Yes or No). (2.5 pts) Write down what the result looks like after a Preorder traversal.  (5 pts) Write down what the result looks like after an Inorder traversal.  (5 pts) Write down what the result looks like after a Postorder traversal.  (5 pts) Write down what the result looks like after a Levelorder traversal.  (5 pts)