LeetCode 145. Binary Tree PostOrder Traversal | JSer - JavaScript & Algorithm

preview_player
Показать описание
PostOrder traversal is similar to inorder one, but with a little trick of marking the traversal status of one node.
I often use this trick in BFS - add `null` as an ending identifier.

Hi I'm a JavaScript engineer who is not good at algorithms,
and currently practicing leetCode online. If you are interested, maybe we can learn together.
Рекомендации по теме
Комментарии
Автор

Thx bro! Leetcode removed solution for this task for some reason and also changed difficulty from hard to easy.

PulIoFF