public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
Stack<TreeNode> stack = new Stack<>();
while (!stack.isEmpty()) {
if (curNode.right != null) {
stack.push(curNode.right);
if (curNode.left != null) {
stack.push(curNode.left);