data structures interview questions-trees - balututorials
DESCRIPTION
NETTRANSCRIPT
Data Structures Interview Questions-Trees
Data Structures InterviewQuestionsTrees
1. The height of a BST is given as h. Consider the height of the tree as the no. of edges in thelongest path from root to the leaf. The maximum no. of nodes possible in the tree is?
a) 2h1 1 b) 2h+1 1 c) 2h +1 d) 2h1 +1
2. The no of external nodes in a full binary tree with n internal nodes is?
a) n b) n+1 c) 2n d) 2n + 1
3. The difference between the external path length and the internal path length of a binarytree with n internal nodes is?
a) 1 b) n c) n + 1 d) 2n
4. Suppose a binary tree is constructed with n nodes, such that each node has exactly eitherzero or two children. The maximum height of the tree will be?
a) (n+1)/2 b) (n1)/2 c) n/2 1 d) (n+1)/2 1
5. Which of the following statement about binary tree is CORRECT?
a) Every binary tree is either complete or fullb) Every complete binary tree is also a full binary treec) Every full binary tree is also a complete binary treed) A binary tree cannot be both complete and full
6. Suppose we have numbers between 1 and 1000 in a binary search tree and want to searchfor the number 363. Which of the following sequence could not be the sequence of the nodeexamined?
a) 2, 252, 401, 398, 330, 344, 397, 363b) 924, 220, 911, 244, 898, 258, 362, 363c) 925, 202, 911, 240, 912, 245, 258, 363d) 2, 399, 387, 219, 266, 382, 381, 278, 363
7. In full binary search tree every internal node has exactly two children. If there are 100 leaf
SUBSCRIBE VIA EMAIL
Name
Email *
Subscribe
ADVERTISEMENTS
LATEST JOBS UPDATES
Google Web Hosting
Acti 9 Distribution Board
Manipal University (MU)
Start Downloadfromdoctopdf.com
Convert Any File to a PDF. Get the Free FromDoc to Pdf App!
HOME OBJECTIVE C DATA STRUCTURE SQLITE C INTERVIEW QUESTIONS C++ INTERVIEW QUESTIONS C SOFTWARES
PROJECTS TECH NEWS
ὐ�Search...
nodes in the tree, how many internal nodes are there in the tree?
a) 25 b) 49 c) 99 d) 101
8. Which type of traversal of binary search tree outputs the value in sorted order?
a) Preorder b) Inorder c) Postorder d) None
Data Structures Interview QuestionsTrees9. Suppose a complete binary tree has height h>0. The minimum no of leaf nodes possible interm of h is?
a) 2h 1 b) 2h 1 + 1 c) 2h 1 d) 2h +1
10. A 23 is a tree such that
a) All internal nodes have either 2 or 3 childrenb) All path from root to leaves have the same length.The number of internal nodes ofa 23 tree having 9 leaves could be
a) 4 b) 5 c) 6 d) 7
11. If a node having two children is to be deleted from binary search tree, it is replaced by its
a) Inorder predecessor b) Inorder successor c) Preorder predecessor d) None
12. A binary search tree is formed from the sequence 6, 9, 1, 2, 7, 14, 12, 3, 8, 18. Theminimum number of nodes required to be added in to this tree to form an extended binary treeis?
a) 3 b) 6 c) 8 d) 11
13. In a full binary tree, every internal node has exactly two children. A full binary tree with2n+1 nodes contains
a) n leaf node b) n internal nodes c) n1 leaf nodes d) n1 internal nodes
14. the run time for traversing all the nodes of a binary search tree with n nodes and printingthem in an order is
a) O(nlg(n)) b) O(n) c) O(√n) d) O(log(n))
15. When a binary tree is converted in to an extended binary tree, all the nodes of a binarytree in the external node becomes
a) Internal nodes b) External nodes c) Root nodes d) None
16. If n numbers are to be sorted in ascending order in O(nlogn) time, which of the followingtree can be used
a) Binary tree b) Binary search tree c) Maxheap d) Minheap
Data Structures Interview QuestionsTrees
17. If n elements are sorted in a binary search tree. What would be the asymptotic complexityto search a key in the tree?
a) O(1) b) O(logn) c) O(n) d) O(nlogn)
RECENT POSTS
C++ Placement Questions and Answers
CPP Interview Questions and Answers
C++ Interview Questions and Answers ForFreshers
Data Structures Interview QuestionsTrees
Data Structures Interview QuestionsQueue
Data Structures Interview QuestionsStacks
Data Structures Interview QuestionsSorting
Data Structures Interview QuestionsLinked List
Data Structures Interview QuestionsPlacementpaper
Data Structures Interview Questions
Be the first of your friends to like this
Balututorials3,267 likes
Like Page Share
Live Traffic Feed
Realtime view · Get Feedjit
A visitor from Delhi viewed"BALUTUTORIALS Destination TowardsKnowledge and Success" 1 min agoA visitor from Bergen, Hordaland viewed "CPlacement PaperCDAC" 5 mins agoA visitor from San Francisco, California viewed"basic c++ interview questions and answers forfreshers pdf free download Archives BALUTUTORIALS" 19 mins agoA visitor from Boston, Massachusetts viewed"C++ Placement Questions and Answers BALUTUTORIALS" 21 mins agoA visitor from Mountain View, Californiaviewed "Integrate SQLite Source Code withDevC++ Project" 34 mins agoA visitor from Bangalore, Karnataka viewed"basic c++ interview questions and answers forfreshers pdf free download Archives BALUTUTORIALS" 47 mins agoA visitor from Mountain View, Californiaviewed "Array Aptitude Questions in C withAnswers BALUTUTORIALS" 1 hr 5 minsagoA visitor from United States viewed "LenevoA600 Plus Specifications And Price In India BALUTUTORIALS" 1 hr 8 mins agoA visitor from Hyderabad, Andhra Pradeshviewed "About Us BALUTUTORIALS" 1 hr59 mins agoA visitor from Bangalore, Karnataka viewed"Mini Project Employee Record ManagementSystem Using C" 2 hrs 6 mins ago
Tweet 0 StumbleUpon
Data Structures InterviewQuestionsQueue June 24, 2015
Data Structures InterviewQuestionsStacks May 31, 2015
Data Structures InterviewQuestionsLinked List May 31, 2015
18. If n elements are sorted in a balanced binary search tree. What would be the asymptoticcomplexity to search a key in the tree?
a) O(1) b) O(logn) c) O(n) d) O(nlogn)
19. The minimum number of elements in a heap of height h is
a) 2h+1 b) 2h c) 2h 1 d) 2h1
20. The maximum number of elements in a heap of height h is
a) 2h+1 1 b) 2h c) 2h 1 d) 2h 1
21. A threaded binary tree is a binary tree in which every node that does not have right childhas a thread to its
a) Preorder successor b) Inorder successor c) Inorder predecessor d) Postordersuccessor
22. In which of the following tree, parent node has a key value greater than or equal to thekey value of both of its children?
a) Binary search tree b) Threaded binary tree c) Complete binary tree d) Maxheap
23. A binary tree T has n leaf nodes. The number of nodes of degree 2 in T is
a) log2n b) n1 c) n d) 2n
24. A binary search tree is generated by inserting in order the following integers:50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24 The number of the node in the left subtree and rightsubtree of the root, respectively, is
a) (4, 7) b) (7, 4) c) (8, 3) d) (3, 8)
ABOUT BALU NAIK
RELATED ARTICLES
24x7 Elder Care atHomeMedically Trained, CertifiedNurses Book Home Visit.Contact Now!
1Like
Previous:Data Structures Interview QuestionsQueue« Next:
C++ Interview Questions and AnswersFor Freshers»
Data Structures InterviewQuestionsPlacement paper May 31, 2015
Data Structures InterviewQuestions May 30, 2015
LEAVE A REPLY
Your email address will not be published. Required fields are marked *
Name *
Email *
Website
Post Comment
Copyright © 2015.All Rights Reserved.Balututorials
