Leetcode - 144 - Binary Tree Preorder Traversal (medium)

Recursive:

Java:

public List<Integer> preorderTraversal(TreeNode root) {
	List<Integer> pre = new LinkedList<Integer>();
	preHelper(root,pre);
	return pre;
}
public void preHelper(TreeNode root, List<Integer> pre) {
	if(root==null) return;
	pre.add(root.val);
	preHelper(root.left,pre);
	preHelper(root.right,pre);
}

// https://leetcode.com/problems/binary-tree-preorder-traversal/discuss/45468/3-Different-Solutions

 

Iterative:

Because of the LIFO property of the stack, we save right child and then the left child.

Java:

public List<Integer> preorderIt(TreeNode root) {
	List<Integer> pre = new LinkedList<Integer>();
	if(root==null) return pre;
	Stack<TreeNode> tovisit = new Stack<TreeNode>();
	tovisit.push(root);
	while(!tovisit.empty()) {
		TreeNode visiting = tovisit.pop();
		pre.add(visiting.val);
		if(visiting.right!=null) tovisit.push(visiting.right);
		if(visiting.left!=null) tovisit.push(visiting.left);
	}
	return pre;
}

// https://leetcode.com/problems/binary-tree-preorder-traversal/discuss/45468/3-Different-Solutions

Python:

def preorderTraversal(self, root):
    ret = []
    stack = [root]
    while stack:
        node = stack.pop()
        if node:
            ret.append(node.val)
            stack.append(node.right)
            stack.append(node.left)
    return ret

# https://leetcode.com/problems/binary-tree-preorder-traversal/discuss/45273/Very-simple-iterative-Python-solution

C++:

class Solution {
public:
    vector<int> preorderTraversal(TreeNode *root) {
        stack<TreeNode*> nodeStack;
        vector<int> result;
        //base case
        if(root==NULL)
        return result;
        nodeStack.push(root);
        while(!nodeStack.empty())
        {
            TreeNode* node= nodeStack.top();
            result.push_back(node->val);
            nodeStack.pop();
            if(node->right)
            nodeStack.push(node->right);
            if(node->left)
            nodeStack.push(node->left);
        }
        return result;
        
    }
};

// https://leetcode.com/problems/binary-tree-preorder-traversal/discuss/45493/Accepted-code.-Explaination-with-Algo.