LeeCode 94 Binary Tree Inorder Traversal
来源:互联网 发布:天视6.3监控软件 编辑:程序博客网 时间:2024/06/05 03:56
题目
分析
二叉树的中序遍历,用递归即可过。
题解
/** * 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> ans; vector<int> inorderTraversal(TreeNode* root) { if(root == NULL) return ans; inorderTraversal(root->left); ans.push_back(root->val); inorderTraversal(root->right); return ans; }};
0 0
- LeeCode 94 Binary Tree Inorder Traversal
- LeeCode Binary Tree Preorder ,inorder ,postorder Traversal
- leecode 解题总结:94. Binary Tree Inorder Traversal
- LeeCode 106. Construct Binary Tree from Inorder and Postorder Traversal
- 94Binary Tree Inorder Traversal
- [94]Binary Tree Inorder Traversal
- 94Binary Tree Inorder Traversal
- 94、Binary Tree Inorder Traversal
- 94 - Binary Tree Inorder Traversal
- 94-Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- 图的邻接表存储 cpp实现
- task_rq(p)
- 固定链接更改后,文章打不开解决方案
- IE和火狐关于文件上传路径然后下载的问题(正常路径IE识别,火狐识别不出正常的路径)
- 多线程下载原理
- LeeCode 94 Binary Tree Inorder Traversal
- Android Studio中如何在Debug模式运行的时候自动签名
- CountDownLatch,CyclicBarrier,Semaphore
- Java中静态变量和实例变量的区别
- SO_RCVLOWAT和SO_SNDLOWAT选项
- ubantu下codeblock如何配色
- 一个最基本的二叉树
- http://blog.csdn.net/jhh_move_on/article/details/36932239
- apache+tomcat二级域名配置方法