8. Trees

Tree traversals

0 of 5 activities0%

Reading 1

Orders of visiting

Open

Preorder: node, left, right. Inorder: left, node, right (BST gives sorted order). Postorder: left, right, node. Level order: BFS with a queue.

Know recursive and iterative patterns.

void inorder(TNode* t){
  if(!t) return;
  inorder(t->left);
  cout<<t->val<<" ";
  inorder(t->right);
}

Check 2

Open

Inorder on a BST yields

Fill in 3

Open

Try it 4

Open

1 2 3 tree.

main.cpp

Loading editor…

Program input (stdin)

Output will appear here.

Assignment 5

Open

Read a word: pre, in, or post. Echo it back (identify you know the labels).

main.cpp

Loading editor…