Data Structures

What is Tree data structure?

• Collection of nodes

• Collection of nodes and edges

• collection of data

• Collection of similar data

What is a tree data structure?

• A linear data structure that stores data elements sequentially.

• A non-linear data structure that consists of nodes connected by edges.

• A data structure where elements are stored in a stack-like manner.

• A data structure that only stores numerical data.

What is a key advantage of a tree data structure over a linear data structure?

• Linear data structures are always faster for data access.

• Tree data structures store elements in a sequential form.

• Tree data structures allow for easier and quicker access to data elements.

• Linear data structures have lower time complexity with increased data size.

In a tree data structure, what is a node called if it does not have any children?

• Root node

• Parent node

• Leaf node

• Internal node

Are you enjoying the video lesson?

• Yes

• No

What is the level of the root node in a tree data structure?

• Level 1

• Level 0

• Level 2

• Level -1

What defines the height of a node in a tree data structure?

• The total number of nodes from the root to that node.

• The total number of edges from the root to that node.

• The total number of edges from a leaf node to that node in the longest path.

• The total number of nodes from a leaf node to that node in the longest path.

Which statement accurately describes a binary tree?

• Each parent node can have any number of children.

• Each parent node has at most two children.

• Each parent node has exactly two children.

• Each parent node has at least two children.

What is the range of the balance factor for a node in an AVL tree?

• -2, -1, 0, 1, 2

• -1, 0, 1

• 0, 1

• Any integer value

Which of the following is NOT a common application of tree data structures?

• Checking for element presence in a set using Binary Search Trees.

• Storing routing information in network routers using Tries.

• Validating program syntax in compilers using syntax trees.

• Managing memory allocation in operating systems.