Tomatosouse

```js //找到整个树最左的结点 //出栈后面的结点一定为前面出栈的父结点 //再查找右结点 var inorderTraversal = function (root) { let arr = []; let stack = []; let cur = root; while(cur || stack.length > 0){ if(cur){ stack.push(cur); cur...

```js //将链表元素入栈，然后逐个出栈建立新链表 var reverseList = function (head) { let cur = head; let arr = []; while (cur) { arr.push(cur.val); cur = cur.next; } let newHead = new ListNode(null); let...

金额： 30.00元 昵称： 峰 ylf920812 感谢技术胖的教程