2020年1月10日
[LeetCode] 145. Binary Tree Postorder Traversal
摘要： Given the root of a binary tree, return the postorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [3,2,1] Example 2: 阅读全文
posted @ 2020-01-10 03:48 CNoodle 阅读(446) 评论(0) 推荐(0)
[LeetCode] 94. Binary Tree Inorder Traversal
摘要： Given the root of a binary tree, return the inorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [1,3,2] Example 2: I 阅读全文
posted @ 2020-01-10 02:41 CNoodle 阅读(544) 评论(0) 推荐(0)