[자료구조] Binary Tree Preorder Traversal

바이너리 트리에서 전위순회 구현해보기 Given a binary tree, return the preorder traversal of its nodes’ values. For example: Given binary tree [1,null,2,3], 1 \ 2 / 3 return [1,2,3]. Note: Recursive solution is trivial, could...