Tree Data Structure Quiz

What is the root node in a tree data structure?

• The last node of the tree

• The first node of the tree

• A node with only one child

• A node with no child

What is the connecting link of any two nodes in a tree data structure called?

• Path

• Edge

• Branch

• Link

What is the node that is the predecessor of any node known as in a tree data structure?

• Child

• Leaf node

• Parent node

• Siblings

What is the total number of children of a node called in a tree data structure?

• Degree

• Height

• Depth

• Level

What is the type of tree where there are no constraints on the hierarchical structure?

• Binary Search Tree

• AVL Tree

• Binary Tree

• General Tree

What is the property of a binary search tree that states the value of a left child node should be less than or equal to the parent node value?

• Binary property

• Binary search property

• Unique property

• Search property

What is the type of tree that is a more constricted extension of a binary tree data structure?

• AVL Tree

• General Tree

• Binary Search Tree

• Binary Tree

What is the process of visiting each node and printing their value in a tree data structure called?

• Insertion

• Sorting

• Searching

• Traversal

In which traversal does the left subtree get visited first, then the root, and later the right subtree?

• Pre-order Traversal

• Level Traversal

• In-Order Traversal

• Post-order Traversal

What is the application of a binary search tree (BST)?

• Database usage

• Checking element presence

• Modem routing

• Heap sort