leetcode:Binary Tree Inorder Traversal

来源：互联网发布：数据库设计步骤编辑：程序博客网时间：2024/06/06 00:13

/** * Definition for binary tree * 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> inorder;        stack<TreeNode *> tree;        TreeNode *p=root;        if(p==NULL)  return inorder;        while(p||!tree.empty())        {            if(p)            {               tree.push(p);               p=p->left;            }                        else            {                p=tree.top();                inorder.push_back(p->val);                tree.pop();                p=p->right;                      }        }        return inorder;}};

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
[leetcode]Spiral Matrix&&Spiral Matrix II
开闭原则
杭电1166 敌兵布阵线段树and树状数组
POJ 2488 A Knight's Journey DFS
图论（一）最小生成树
leetcode:Binary Tree Inorder Traversal
XML 简介
选择排序法
GCD小结
Android 101 for iOS Developers
向量的数量函数的导数
js冒泡、捕获事件及阻止冒泡方法
第11周项目1-2
VTK/Examples/Cxx/PolyData/VertexConnectivity