【LeetCode 144_二叉樹_遍歷】Binary Tree Preorder Traversal

解法一:非遞歸 1 vector<int> preorderTraversal(TreeNode* root) 2 { 3 vector<int> res; 4 if (root == NULL) 5 return res; 6 7 stack<TreeNode*> node_stack; 8 TreeNode *p = root
相關文章
相關標籤/搜索