DSLO: Trees

Tree  ●

Depth first search  ●

Preorder  ●

Inorder  ●

Postorder  ●

Traverse  ●

Breadth first search  ●

Breadth first traverse  ●

All traverses  ●

BST insertion  ●

BST searching example 1  ●

BST searching example 2  ●

Deletion: node with one child 1  ●

Deletion: node with one child 2  ●

Deletion: node with two children  ●

MCQ  ●