Define the difference between Binary Search Trees and Nodes?
In DrRacket:
Define the difference between Binary Search Trees and Nodes?
A) A Binary Search Tree is a Node, but a Node isn’t always a Binary Search Tree.
B) A Node is a Binary Search Tree, but a Binary Search Tree isn’t always a Node.
C) Binary Search Trees may contain Nodes, but Nodes cannot contain Binary Search Trees.
D) Nodes may contain Binary Search Trees, but Binary Search Trees cannot contain Nodes.
E) They are the same thing
A node is a basic unit of data structure in building a tree or a graph.
Binary search tree is a data structure that is sorted and each node can have a maximum of two nodes.
A binary search tree is a collection of nodes and node is the basic data structure
Trending now
This is a popular solution!
Step by step
Solved in 2 steps