Given a binary tree, return the preorder traversal of its nodes values. For example: Given binary tree {1,#,2,3}, 1\2/3return [1,2,3]. Note: Recursive solution is trivial, could you do it iteratively? Recursive: [cpp] view plaincopyprint? /** * Defin…