Merge two sorted linked lists and return it as a new sorted list. The new list should be made by splicing together the nodes of the first two lists.
Given a sorted array nums, remove the duplicates in-place such that each element appears only once and returns the new length.
Given the root of a binary tree, return the inorder traversal of its nodes' values.
Given a non-negative integer x, compute and return the square root of x.
Since the return type is an integer, the decimal digits are truncated, and only the integer part of the result is returned.