I mainly need part 3, but it would be nice to have the rest to check.

Problem 5. Consider the tree drawing method covered in class (slide 13 (Trees)). 1. Let (v) be the preorder rank of v (rather than the inorder rank of v), and draw the tree in slide 13 accordingly. 2. Draw the tree if (v) is the postorder rank of v. 3. Let T be any binary tree. Show that if (v) is the preorder rank of v and y() is the depth of v, for all nodes v of T, then the resulting drawing of T has no edges crossing. Inorder Traversal ch In an inorder traversal a node is visited after its left subtree and before its right subtree Application: draw a binary tree x(v) = inorder rank of v = y(v) = depth of v Algorithm inOrder(v) if is Internal (V) inOrder (leftChild (v)). visit(v) if is Internal (v) inOrder (rightChild (v)) 1/13/2020 2:13 PM Trees Problem 5. Consider the tree drawing method covered in class (slide 13 (Trees)). 1. Let (v) be the preorder rank of v (rather than the inorder rank of v), and draw the tree in slide 13 accordingly. 2. Draw the tree if (v) is the postorder rank of v. 3. Let T be any binary tree. Show that if (v) is the preorder rank of v and y() is the depth of v, for all nodes v of T, then the resulting drawing of T has no edges crossing. Inorder Traversal ch In an inorder traversal a node is visited after its left subtree and before its right subtree Application: draw a binary tree x(v) = inorder rank of v = y(v) = depth of v Algorithm inOrder(v) if is Internal (V) inOrder (leftChild (v)). visit(v) if is Internal (v) inOrder (rightChild (v)) 1/13/2020 2:13 PM Trees