LeetCode-94-Binary Tree Inorder Traversal
发布时间:2020-12-14 04:26:18 所属栏目:大数据 来源:网络整理
导读:算法描述: Given a binary tree,return the? inorder ?traversal of its nodes‘ values. Example: Input: [1,null,2,3] 1 2 / 3Output: [1,3,2] Follow up:?Recursive solution is trivial,could you do it iteratively? 算法分析:二叉树中序遍历,非递归
算法描述: Given a binary tree,return the?inorder?traversal of its nodes‘ values. Example: Input: [1,null,2,3] 1 2 / 3 Output: [1,3,2] Follow up:?Recursive solution is trivial,could you do it iteratively? 算法分析:二叉树中序遍历,非递归方法用栈辅助。 vector<int> inorderTraversal(TreeNode* root) { vector<int> results; stack<TreeNode*> stk; while(root!=nullptr || !stk.empty()){ while(root!=nullptr){ stk.push(root); root=root->left; } TreeNode* temp = stk.top(); stk.pop(); results.push_back(temp->val); root = temp->right; } return results; } (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |