// 中序
inorderTraversal (data) {
let current = data
const stack = []
const result = []
while(current || stack.length) {
while(current) {
stack.push(current)
current = current.left
}
current = stack.pop()
result.push(current.val)
current = current.right
}
return result
}
前序
// 前序
preorderTraversal (root) {
const result = []
const stack = []
let current = root
while(current || stack.length) {
while(current) {
result.push(current.val)
stack.push(current)
current = current.left
}
current = stack.pop()
current = current.right
}
return result
}
后序
// 后序
postorderTraversal (root) {
debugger
const result = [];
const stack = [];
let last = null; // 标记上一个访问的节点
let current = root;
while (current || stack.length > 0) {
while (current) {
stack.push(current);
current = current.left;
}
current = stack[stack.length - 1];
if (!current.right || current.right == last) {
current = stack.pop();
result.push(current.val);
last = current;
current = null; // 继续弹栈
} else {
current = current.right;
}
}
return result;
}