18 True or fabe? 30 points True False A binary tree can be represented using a set of linked nodes n a graph the search can start from any vertex If the new element in binary tree is less than the parent element, the node for the new element becomes the left child of the parent. You can model parent/child relationships using a directed graph, where an edge from vertex x to y indicates that x is a child of y A connected graph is a tree if it does not have cycles With breadth-first traversal of a tree, the nodes are visited from left to right The worst case for insertion sort occurs if the array is initially sorted in reverse order In an undirected graph, you can move in both directions between vertices. LinkedList is ideal for queue operations because it is efficient for inserting and removing elements from both ends of a list An application of preorder is to print a structured document. 12