Self Evaluation Test
Download as PPTX, PDF0 likes3,073 views
The document provides a code snippet for a function named `mirrortree`, which mirrors a binary tree by swapping its left and right children recursively. It also includes operations related to inserting one list into another and managing linked list nodes. The author is Berk Seysal and the document has a URL for more information.
Self Evaluation Test
- 1. 2016 Winter Prepared by: Berk Soysal
- 2. (b) (d)
- 3. (b) (d)
- 4. (c) (a)
- 5. (c) (a) (c)
- 6. (c) (a)
- 7. (c) (a)
- 15. static void mirrorTree(node root) { if(root == null) return; node left = root.getLeft(); node right = root.getRight(); node.setLeft(right); node.setRight(left); mirrorTree(right); mirrorTree(left); }
- 19. 4 1 2 555 100 999 list1 list2
- 20. 4 1 2 Node p Node q = p.next list2 555 100 999 list1.insertAfter(1, list2); otherFirst otherLast p.next = otherFirst; otherFirst.previous = p; otherLast.next = q; q.previous = otherLast;