Chapter 8, Problem 2TQ

Program Plan Intro

Binary tree:

• Binary tree is a hierarchical structure to represent the data. The element of a binary tree is called as a node.
  • Here, the branches are used to connect the nodes.
• Each node may have zero, one, or two children.
• A node that does not have a superior node is called the root node.
• The root node is the starting node, and it is the ancestor for all other nodes in the tree.
• A node that does not have children is called as a leaf node or an end node.

Binary search tree:

• Binary search tree is a tree; the nodes are sorted in the semantic order.
• Binary search tree nodes can have zero, one, or two children.
• Node without children is called a leaf or end node.
• A node that does not have a superior node is called a root node or starting node.
  • In binary search tree, the left subtree contains the nodes lesser than the root node.
  • The right subtree contains the nodes greater than the root node.
• The binary search will perform until finding a search node or reaching the end of the tree.

Graph:

• Graph is a non-linear data structure model that contains set of vertices and edges.
• A node in a graph is called as vertices and the vertices are connected by the edges.
• Graph is classified as,
  • Directed graph – The edges in the graph are directed from one node to another node.
  • Undirected graph – The edges in the graph are not directed from one node to another node.
  • Weighted graph – The edges in the graph having values.

Explanation of Solution

A list ever be a tree:

“Yes”, a list can always become a tree.

• A list includes nodes and pointers.
  • The node includes the value and the pointer used to address the next node.
• Likewise, a tree also includes nodes and pointers.
  • The node includes the value and the pointer represent the relationship between the nodes...

Explanation of Solution

A tree ever be a graph:

“Yes”, maybe all the trees can become a graph.

• A tree includes nodes and pointers.
  • The node includes the value and the pointer represent the relationship between the nodes.
• Likewise, a graph is prepared by a set of vertices and edges.
  • A node in a graph is called vertices.
  • The edges in a graph represent the relationship between the nodes.
  • A tree becomes an acyclic graph when the nodes are connected and have no cycles.

A graph ever be a tree:

“Yes”, maybe a graph can become a tree, but not all the graphs are a tree...

Explanation of Solution

Relationship between a list, tree, and graph:

The above-mentioned structures are use nodes and pointers...