Given a binary tree, return the inorder traversal of its nodes’ values.
For example:Given binary tree {1,#,2,3},
{1,#,2,3}
1 \ 2 / 3
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.