[LeetCode] Binary Tree Inorder Traversal

来源：互联网发布：怎样避免淘宝店铺复核编辑：程序博客网时间：2024/04/27 17:40

vector<int> inorderTraversal(TreeNode *root) {vector<TreeNode*> pre_node;vector<int> val;if (root == NULL){return val;}pre_node.push_back(root);while(!pre_node.empty()){TreeNode* cur_node = pre_node.back();TreeNode* left_leaf = NULL;TreeNode* right_leaf = NULL;if(cur_node != NULL){left_leaf = cur_node->left;right_leaf = cur_node->right;}if(left_leaf != NULL){pre_node.push_back(left_leaf);}else{val.push_back(cur_node->val);pre_node.pop_back();if(right_leaf != NULL){                pre_node.push_back(right_leaf);}else {while(!pre_node.empty()){cur_node = pre_node.back(); val.push_back(cur_node->val);pre_node.pop_back();if(cur_node->right != NULL){pre_node.push_back(cur_node->right);break;}                    }} }}return val;}

0 0

LeetCode: Binary Tree Inorder Traversal
[LeetCode]Binary Tree Inorder Traversal
LeetCode Binary Tree Inorder Traversal
[Leetcode] Binary Tree Inorder Traversal
Leetcode: Binary Tree Inorder Traversal
LeetCode Binary Tree Inorder Traversal
LeetCode : Binary Tree Inorder Traversal
[Leetcode] Binary Tree Inorder Traversal
【leetcode】Binary Tree Inorder Traversal
[LeetCode]Binary Tree Inorder Traversal
Leetcode: Binary Tree Inorder Traversal
[leetcode]Binary Tree Inorder Traversal
LeetCode-Binary Tree Inorder Traversal
Leetcode Binary Tree Inorder Traversal
[leetcode] Binary Tree Inorder Traversal
LeetCode - Binary Tree Inorder Traversal
[LeetCode] Binary Tree Inorder Traversal
LeetCode | Binary Tree Inorder Traversal
一.进程线程
华为（4）数字颠倒
P2P系统
一.进程线程（续）
Mac OS X应用程序下的主要文件夹
[LeetCode] Binary Tree Inorder Traversal
Mac环境下svn的使用
现在公开一个DHT网络爬虫
二.内存管理
poj 2711:合唱队形
空中网多线程面试题2
android自带email常用的URI
POJ 2488:A Knight's Journey
空中网多线程面试题3