WorksheetsQuiz 4
Total questions: 10
Worksheet time: 8mins
It is a highly efficient sorting algorithm and is based on partitioning of array of data into smaller arrays.
(a)
It is the link between any two nodes in the tree.
(a)
It is an entity that contains a key or value and pointers in its child nodes.
(a)
It is the topmost node of a tree.
(a)
It is the total number of branches of the node.
(a)
It is a tree whose elements have at most 2 children, each element is a binary tree can only have 2 children, we name them left and right child.
(a)
It is a type of binary tree which every level, except possibly the last, has to be filled and all nodes are as far left as possible.
(a)
It is a type of binary tree which also called as proper binary tree or 2-tree as a tree in which all the node other than the leaves has exact two children.
(a)
What are the three main operations in Binary Tree?
Add, Edit and Delete
Search, Edit and Delete
Search, Insert and Delete
All of the above.
It is also used to get prefix expression on of an expression tree.
Pre-order Traversal
Post-order Traversal
In-order Traversal
All of the above.
