i found these problems are very hard although they are easy tagged they are looking harder than graphs

inoder,postorder, preorder => recursive is very easy

inoder,postorder, preorder => iterative using 1 stack it will take some time you will understnad and implement

inoder,postorder, preorder => all in one stack (easy)

but i am not able process thing which are going like postorder in 2 stack , then use morrris mano and traverse without any stack

guys please advice me how you appproach a tree problem wheter its a binary tree, BST, tree, trie

i have to study red questions but i feels i am wasting my time here on binary tree

even digit dp is easir than remembering these all traversal techniques