摘要：
Given a binary tree, return the inorder traversal of its nodes' values. Example: Input: [1,null,2,3] 1 \ 2 / 3 Output: [1,3,2] Follow up: Recursive so 阅读全文
posted @ 2020-08-15 13:53
little_veggie
阅读(72)
评论(0)
推荐(0)
摘要：
Given a binary tree, return the postorder traversal of its nodes' values. Example: Input: [1,null,2,3] 1 \ 2 / 3 Output: [3,2,1] Follow up: Recursive 阅读全文
posted @ 2020-08-15 05:38
little_veggie
阅读(78)
评论(0)
推荐(0)
摘要：
Given a binary tree, return the preorder traversal of its nodes' values. Example: Input: [1,null,2,3] 1 \ 2 / 3 Output: [1,2,3] Follow up: Recursive s 阅读全文
posted @ 2020-08-15 05:02
little_veggie
阅读(103)
评论(0)
推荐(0)
浙公网安备 33010602011771号