Data Structures and Algorithms - Trees

Avatto > > UGC NET COMPUTER SCIENCE > > PRACTICE QUESTIONS > > Data Structures and Algorithms > > Trees

11. A binary tree having n nodes and depth d will be about complete binary tree if

Answer
Comment
Array

Option : A
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

12. Which of the following statements are correct? I. If each tree node contains a father field, then it's not necessary to use either stack or threads II. Traversal using father pointers is more time-efficient than traversal of a threaded tree III. An in-threaded binary tree is defined as a binary tree that is both left-in threaded and right-in threaded.

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

13. A binary tree of depth "d" is an almost complete binary tree if

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

14. If each node in a tree has value greater the every value in its left subtree and has value less than every value in its right subtree, the tree is called

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

15. The number of nodes in a complete binary tree of level 5 is

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

Related Quiz.
Trees

Forgot your password?

I agree with the Terms.