5 Questions
Match the following tree terminologies with their definitions:
Root node = The topmost node in a tree Parent node = A node that has child nodes Leaf node = A node with no children Sub-tree = A tree within a tree
Match the following traversal methods with their descriptions:
Inorder Traversal = Visits the left subtree, then the parent node, then the right subtree Preorder Traversal = Visits the parent node, then the left subtree, then the right subtree Postorder Traversal = Visits the left subtree, then the right subtree, then the parent node Binary Search Tree = A tree where every node entry has a unique key and keys in left subtree are less than the key of the node
Match the following binary tree types with their descriptions:
Binary Tree = Each node has at most 2 children Binary Search Tree = Every node entry has a unique key and keys in left subtree are less than the key of the node Inorder Traversal = Visits the left subtree, then the parent node, then the right subtree Postorder Traversal = Visits the left subtree, then the right subtree, then the parent node
Match the following parts of a tree with their definitions:
Root node = The topmost node in a tree Child nodes = Nodes directly connected to another node in a tree Leaf nodes = Nodes with no children Sub-tree = A smaller tree which is part of a larger tree
Match the following parts of a tree with their descriptions:
Parent node = A node that has child nodes Leaf nodes = Nodes with no children Sub-tree = A smaller tree which is part of a larger tree Binary Search Tree = A tree where every node entry has a unique key and keys in left subtree are less than the key of the node
Test your knowledge of tree data structures, including terminology, binary tree traversal, and operations on binary trees. This quiz covers topics such as nodes, root nodes, child nodes, parent nodes, leaf nodes, and sub-trees.
Make Your Own Quizzes and Flashcards
Convert your notes into interactive study material.
Get started for free
