Write the code for the preorder traversal of a tree.

Question

yoda · Accepted Answer

using recursion

public static void preorderTraversal(Tree T,Node root){
      if(root==null){
    return "empty tree";
}
else{
    visit(T,root);
preorderTraversal(T,T,leftChild(root));
preorderTraversal(T,T,rightChild(root));
}
}

w1uo0 · Answer

public static void preorderTraversal(TreeNode node) { Stack

s = new Stack

(); while (node != null || !s.isEmpty()) { while (node != null) { visit(node); node = node.left; } if (!s.isEmpty()) { node = s.pop(); node = node.right; } } }

w1uo0 · Answer

Sorry I forgot to push the node into the stack after visited it

SuperMario · Answer

OMG Why my question is to implememt an AVL tree...

Amazon

Pergunta de entrevista da empresa Amazon

Respostas da entrevista

Empresas seguidas

Buscas de vagas