Given the root of a binary tree, return the inorder traversal of its nodes' values (iteratively).
root = [1,null,2,3]
[1,3,2]
root = []
[]