algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-11 21:10:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix : TypeScript answer

Browse Source 
* Fixing TypeScript traversal answers
- preoder / inorder / postorder has exactly same code, fixed.
This commit is contained in:
MWang
2023-01-25 12:35:45 +08:00
committed by GitHub
parent 2ffbb82aa8
commit 0df3cb0550
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/二叉树的统一迭代法.md
View File

@ -536,9 +536,9 @@ function preorderTraversal(root: TreeNode | null): number[] {
curNode = helperStack.pop()!; curNode = helperStack.pop()!;
if (curNode !== null) { if (curNode !== null) {
if (curNode.right !== null) helperStack.push(curNode.right); if (curNode.right !== null) helperStack.push(curNode.right);
if (curNode.left !== null) helperStack.push(curNode.left);
helperStack.push(curNode); helperStack.push(curNode);
helperStack.push(null); helperStack.push(null);
if (curNode.left !== null) helperStack.push(curNode.left);
} else { } else {
curNode = helperStack.pop()!; curNode = helperStack.pop()!;
res.push(curNode.val); res.push(curNode.val);
@ -579,9 +579,9 @@ function postorderTraversal(root: TreeNode | null): number[] {
while (helperStack.length > 0) { while (helperStack.length > 0) {
curNode = helperStack.pop()!; curNode = helperStack.pop()!;
if (curNode !== null) { if (curNode !== null) {
if (curNode.right !== null) helperStack.push(curNode.right);
helperStack.push(curNode); helperStack.push(curNode);
helperStack.push(null); helperStack.push(null);
if (curNode.right !== null) helperStack.push(curNode.right);
if (curNode.left !== null) helperStack.push(curNode.left); if (curNode.left !== null) helperStack.push(curNode.left);
} else { } else {
curNode = helperStack.pop()!; curNode = helperStack.pop()!;