EASY
Earn 100

The difference between the external path length and the internal path length of a binary tree with n internal nodes is?

50% studentsanswered this correctly

Important Questions on Data Structure

MEDIUM
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
The maximum number of nodes on level i of a binary tree is:
HARD
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
Preorder is nothing but _____.
EASY
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
A B-tree of order 3 is constructed by inserting integers 1,2,3,4,... in ascending order. Which integer causes the leaves to be on level 3 for the first time? (root is on level 1)
MEDIUM
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
A balanced order-n multi-way search tree in which each non-root node contains at least _____ keys is called a B-tree of order n.
HARD
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
The number of possible binary trees with 3 nodes are _____.
HARD
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees

State true or false:

I. A node is a parent if it has successor nodes.

II. A node is child node if out degree is one.

MEDIUM
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
A Binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes of the last level appear as far as left as possible, is known as:
MEDIUM
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees

Let's use the "TreeNode" class defined in our coursework file. Assuming that we need to create a tree like given below, which of the following code is/are correct?
Question Image

HARD
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
If each node in a tree has value greater then every value in its left subtree and has value less than every value in its right subtree, the tree is known as _____.
EASY
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
When we say the order of a tree is M, we mean ______?
HARD
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
The number of binary trees with 3 nodes which when traversed in post order gives the sequence A, B, C is?
EASY
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
_____ is a directed tree in which outdegree of each node is less than or equal to two.
HARD
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as _____.
HARD
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
The major drawback of the B-Tree is the difficulty of traversing the keys sequentially. The _____ tree retains the rapid random access property of the B-tree while allowing rapid sequential access.
EASY
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
Four statements about B-trees are given below. Three of them are correct. Which one is INCORRECT?
HARD
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves:
EASY
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees

Which of the following heap is formed by entering the following series of the values:
6, 5, 2, 4, 1, 7, and 3.

Question Image.

MEDIUM
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
For any B-tree of height H (H>1), after inserting a new key, is it possible for a key, K, which was located in a leaf-node to move up to the root? Which of the following answers is correct?
HARD
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
Stack is useful for implementing _____.
EASY
Computer Awareness and Information Technology>Programming and Data Structures>Data Structure>Trees
What is a complete binary tree?