摘要: 先序遍历非递归算法1 class Solution { public: vector<int> preorderTraversal(TreeNode* root) { stack<TreeNode*> st; vector<int> result; if (root == NULL) return 阅读全文
posted @ 2023-11-16 23:34 老家伙2004 阅读(12) 评论(0) 推荐(0)