using postorder traversal show that the drawing of produced by preorderdraw has no pairs of crossing edges redraw the binary tree of figure using preorderdraw show that the drawing of produced by postorderdraw has no pairs of crossing edges redraw the binary tree of figure using postorderdraw - design an algorithm for drawing general trees that generalizes the inorder traversal approach for drawing binary trees - let visit action in the euler tour traversal be denoted by pair ( , )where is the visited node and is one of leftbelowor right design and analyze an algorithm for performing operation tournext(va)which returns the visit action ( ,bfollowing ( ,ac- consider variation of the linked data structure for binary trees where each node object has references to the node objects of the children but not to the node object of the parent describe an implementation of the methods of binary tree with this data structure and analyze the time complexity for these methods - design an alternative implementation of the linked data structure for proper binary trees using class for nodes that specializes into subclasses for an internal nodean external nodeand the root node - within the linked data structure for binary treesexplore an alternative design for implementing the iterators returned by the methods iterator()positions(iterator()and children(viterator(such that each of these methods takes ( time can you still achieve constant time implementations for the methods hasnext(and next(of the iterators returnedc-