#Leetcode# 94. Binary Tree Inorder Traversal
发布时间:2020-12-14 04:28:09 所属栏目:大数据 来源:网络整理
导读:https://leetcode.com/problems/binary-tree-inorder-traversal/ ? Given a binary tree,return the? inorder ?traversal of its nodes‘ values. Example: Input: [1,null,2,3] 1 2 / 3Output: [1,3,2] 代码: /** * Definition for a binary tree node. *
https://leetcode.com/problems/binary-tree-inorder-traversal/ ? Given a binary tree,return the?inorder?traversal of its nodes‘ values. Example: Input: [1,null,2,3] 1 2 / 3 Output: [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> ans; inorder(ans,root); return ans; } void inorder(vector<int>& ans,TreeNode* root) { if(root == NULL) return ; inorder(ans,root -> left); ans.push_back(root -> val); inorder(ans,root -> right); } }; 二叉树 get 第一个?Medium 中序遍历 (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |