LeetCode 记忆题模板(快排,非递归遍历...)
中序遍历
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> ans = new ArrayList<>();
Stack<TreeNode> stack = new Stack<>();
TreeNode cur = root;
while(cur !=
原创
2020-09-02 00:05:38 ·
117 阅读 ·
0 评论