摘要：
与前面的先序遍历相似。此题为后序遍历。C++： 1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *rig... 阅读全文
摘要：
Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 /3return [1,2,3].可用递归，进行。也可以用迭代... 阅读全文