Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.A height-balanced bin

Given the root of a binary tree, return its maximum depth.A binary tree's maximum depth is the number of nodes along the longest path from the root no