- 先序遍历:根-左-右
//入站要先右节点在左节点
class Solution {
public:
void preorderTraversal(TreeNode* root) {
if (!root)
//入站要先右节点在左节点
class Solution {
public:
void preorderTraversal(TreeNode* root) {
if (!root)
418
510
2044