LeetCode OJ 94. Binary Tree Inorder Traversal
2024-10-15 07:12:22
Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree [1,null,2,3]
,
1 \ 2 / 3
return [1,3,2]
.
Note: Recursive solution is trivial, could you do it iteratively?
Subscribe to see which companies asked this question
解答
原来那个returnSize是拿来返回产生的中序遍历的数组大小用的……数组下标从0开始计算……
/** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ /** * Return an array of size *returnSize. * Note: The returned array must be malloced, assume caller calls free(). */ int* inorderTraversal(struct TreeNode* root, int* returnSize) { ], top = -, i = ; ); != top||NULL != root){ while(NULL != root){ stack[++top] = root; root = root->left; } root = stack[top--]; return_array[i++] = root->val; root = root->right; } *returnSize = i; return return_array; }
最新文章
- JVM Tomcat性能实战
- R语言学习笔记:小试R环境
- JVM性能调优
- Java读取图片并修改像素,创建图片
- error: dst ref refs/heads/zhCN_v0.13.1 receives from more than one src.
- [转贴]JAVA 百度地图SDK地图学习——实现定位功能
- 『Python』爬行搜索引擎结果获得指定主机二级域名及IP信息
- RH253读书笔记(1)-Lab 1 System Monitoring
- MVC视图中的@Html.xxx(...)
- 重构了cxlt-vue2-toastr插件
- HTML5 进阶系列:拖放 API 实现拖放排序(转载)
- CTSC 2017 滚粗记
- 3.jmeter接口测试---脚本录制
- CSS3之动画模块实现云朵漂浮效果
- SQL将Null转化为0
- openstack-networking-neutron(一)---端到端和点到点的理解
- HDU 1176 免费馅饼 (类似数字三角形的题,很经典,值得仔细理解的dp思维)
- 在aspx页面中使用三元表达式
- Mac下git安装(使用Xcode)
- CURL简单使用