Given the root of a binary tree, implement inorder (left, node, right) and postorder (left, right, node) traversal, each both recursively and iteratively, returning the node values as a list.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.