let doSmth = () => { return new Promise((resolve, reject) => { if (Math.random() > 0.5) { resolve(‘doSmth success’); } else {
]]>Given a binary tree, find its minimum depth.
The minimum depth is the number of nodes along the shortest path from the root node
]]>/** * Definition for a binary tree node. * public class TreeNode { * public int val; * public TreeNode left; * public TreeNode
]]>Given the roots of two binary trees p and q, write a function to check if they are the same or not.
Two binary trees are considered
]]>
]]>