leetcode 二叉树中序遍历的递归和非递归实现
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了leetcode 二叉树中序遍历的递归和非递归实现相关的知识,希望对你有一定的参考价值。
Given a binary tree, return the inorder traversal of its nodes‘ values.
For example:
Given binary tree {1,#,2,3}
,
1 2 / 3
return [1,3,2]
.
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: vector<int> inorderTraversal(TreeNode* root) { vector<int> vec; inOrder(root, vec); return vec; } /* void inOrder(TreeNode *root, vector<int> &path) { //递归写法 if (root) { inOrder(root->left, path); path.push_back(root->val); inOrder(root->right, path); } } */ //非递归写法 void inOrder(TreeNode *root, vector<int> &path) { stack<TreeNode *> TreeNodeStack; while (root != NULL || !TreeNodeStack.empty()) { while(root != NULL) { TreeNodeStack.push(root); root = root->left; } if (!TreeNodeStack.empty()) { root = TreeNodeStack.top(); TreeNodeStack.pop(); path.push_back(root->val); root = root->right; } } } };
以上是关于leetcode 二叉树中序遍历的递归和非递归实现的主要内容,如果未能解决你的问题,请参考以下文章