[合集] J妹,什么叫做肉鸡卡?# Living
S*C
1 楼
public List inorderTraversal(TreeNode root) {
List res = new ArrayList();
if (root == null)
return res;
Stack stack = new Stack();
TreeNode p = root;
while (!stack.isEmpty() || p != null) {
// if it is not null, push to stack
//and go down the tree to left
if (p != null) {
stack.add(p);//stack.push(p);
p = p.left;
} else {// if no left child,
//pop stack, process the node
// then let p point to the right
p = stack.pop();
res.add(p.val);
p = p.right;
}
}
return res;
}
List
if (root == null)
return res;
Stack
TreeNode p = root;
while (!stack.isEmpty() || p != null) {
// if it is not null, push to stack
//and go down the tree to left
if (p != null) {
stack.add(p);//stack.push(p);
p = p.left;
} else {// if no left child,
//pop stack, process the node
// then let p point to the right
p = stack.pop();
res.add(p.val);
p = p.right;
}
}
return res;
}