摘要: 还是用堆栈的想法,使用堆栈来实现遍历顺序的变化与调整,贴代码 1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right 阅读全文
posted @ 2021-08-18 10:42 zhaohhhh 阅读(32) 评论(0) 推荐(0)