14 Days Study Plan to Crack Algo I

Day 8

617. Merge Two Binary Trees

Input: root1 = [1,3,2,5], root2 = [2,1,3,null,4,null,7]
Output: [3,4,5,5,4,null,7]
Input: root1 = [1], root2 = [1,2]
Output: [2,2]
  • The number of nodes in both trees is in the range [0, 2000].
  • -104 <= Node.val <= 104

116. Populating Next Right Pointers in Each Node

struct Node {
int val;
Node *left;
Node *right;
Node *next;
}
Input: root = [1,2,3,4,5,6,7]
Output: [1,#,2,3,#,4,5,6,7,#]
Explanation: Given the above perfect binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B. The serialized output is in level order as connected by the next pointers, with '#' signifying the end of each level.
Input: root = []
Output: []
  • The number of nodes in the tree is in the range [0, 212 - 1].
  • -1000 <= Node.val <= 1000
  • You may only use constant extra space.
  • The recursive approach is fine. You may assume implicit stack space does not count as extra space for this problem.

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store