94. Binary Tree Inorder Traversal

struct TreeNode{ int val; TreeNode * left; TreeNode * right; }; vector<int> inorderTraversal(TreeNode * root){ }
Given a binary tree, return the inorder traversal of its nodes' values.

1 Response

Note first: if you are writing this function yourself, can you figure out the return type?

Write a comment

You can use [html][/html], [css][/css], [php][/php] and more to embed the code. Urls are automatically hyperlinked. Line breaks and paragraphs are automatically generated.