Askmeabout

Lets share our knowledge

Q & A

Q & A › Category: Data Structure
Filter:AllOpenResolvedClosedUnanswered
What is the average case time complexity for finding the height of the binary tree?
AnsweredAdmin asked 4 years ago • 
226 views1 answers0 votes
What is a complete binary tree?
AnsweredAdmin asked 4 years ago • 
64 views1 answers0 votes
What is a full binary tree?
AnsweredAdmin asked 4 years ago • 
54 views1 answers0 votes
The number of edges from the node to the deepest leaf is called _________ of the tree.
AnsweredAdmin asked 4 years ago • 
223 views1 answers-1 votes
The number of edges from the root to the node is called __________ of the tree.
AnsweredAdmin asked 4 years ago • 
166 views1 answers-2 votes
In a binary search tree, which of the following traversals would print the numbers in the ascending order?
AnsweredAdmin asked 4 years ago • 
129 views1 answers-1 votes
Which of the following graph traversals closely imitates level order traversal of a binary tree?
AnsweredAdmin asked 4 years ago • 
159 views1 answers0 votes
What is the time complexity of level order traversal?
AnsweredAdmin asked 4 years ago • 
60 views1 answers0 votes
What is the space complexity of the in-order traversal in the recursive fashion?
AnsweredAdmin asked 4 years ago • 
72 views1 answers0 votes
For a binary tree the first node visited in in-order and post-order traversal is same.
AnsweredAdmin asked 4 years ago • 
62 views1 answers0 votes
The steps for finding post-order traversal are traverse the right subtree, traverse the left subtree or visit the current node.
AnsweredAdmin asked 4 years ago • 
80 views1 answers1 votes
The maximum number of nodes in a tree for which post-order and pre-order traversals may be equal is ______
AnsweredAdmin asked 4 years ago • 
199 views1 answers1 votes
A full binary tree can be generated using ______
AnsweredAdmin asked 4 years ago • 
102 views1 answers0 votes
Which of the following pair’s traversals on a binary tree can build the tree uniquely?
AnsweredAdmin asked 4 years ago • 
91 views1 answers0 votes
What is the possible number of binary trees that can be created with 3 nodes, giving the sequence N, M, L when traversed in post-order.
AnsweredAdmin asked 4 years ago • 
61 views1 answers0 votes
1234…20
Ask Question