breadth first search

depth first search

recursion

Both 1) depth first search and 2) recursion

3, 4, 5, 1, 2

3, 4, 5, 2, 1

1, 5, 2, 3, 4

5, 4, 3, 1, 2

Every tree is a bipartite graph

A tree contains a cycle

A tree with n nodes contains n-1 edges

A tree is a connected graph

It is an m-ary tree

Successful searches should terminate in leaf nodes

Unsuccessful searches may terminate in leaf nodes level of the tree structure

All of these

Full binary tree

Binary Search Tree

Threaded tree

Complete binary tree