2019年10月31日
力扣算法题—143ReorderList
摘要： Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You may not modify the values in the list's nodes, only nodes its 阅读全文
posted @ 2019-10-31 23:58 自由之翼Az 阅读(162) 评论(0) 推荐(0)
力扣算法题—144Binary Tree Preorder Traversal
摘要： Given a binary tree, return the preorder traversal of its nodes' values. Example: Follow up: Recursive solution is trivial, could you do it iterativel 阅读全文
posted @ 2019-10-31 23:32 自由之翼Az 阅读(169) 评论(0) 推荐(0)
力扣算法题—145BinartTreePostorderTraversal
摘要： Given a binary tree, return the postorder traversal of its nodes' values. Example: Follow up: Recursive solution is trivial, could you do it iterative 阅读全文
posted @ 2019-10-31 23:22 自由之翼Az 阅读(159) 评论(0) 推荐(0)