trees..in order pre order

Question

Basic Print inorder and preorder. C++ · Accepted Answer

void inorder(tree t) { if(t == NULL) return; inorder(t -> left); cout left right); } void preorder(tree t) { if(t == NULL) return; cout left left); preorder(t -> right); } Since I'm already this far here is post order as well: void postorder(tree t) { if(t == NULL) return; postorder(t -> left); postorder(t -> right); cout left << " "; }

CORRECTION Ignore the above post. · Answer

CORRECTION: It should be printing t -> val, not t -> left Sorry! void inorder(tree t) { if(t == NULL) return; inorder(t -> left); cout val right); } void preorder(tree t) { if(t == NULL) return; cout val left); preorder(t -> right); } Since I'm already this far here is post order as well: void postorder(tree t) { if(t == NULL) return; postorder(t -> left); postorder(t -> right); cout val << " "; }

Amazon

Amazon Interview Question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches