ALLInterview.com :: Home Page            
 Advertise your Business Here     
Browse  |   Placement Papers  |   Company  |   Code Snippets  |   Certifications  |   Visa Questions
Post Question  |   Post Answer  |   My Panel  |   Search  |   Articles  |   Topics  |   ERRORS new
   Refer this Site  Refer This Site to Your Friends  Site Map  Bookmark this Site  Set it as your HomePage  Contact Us     Login  |  Sign Up                      
Google
   
 
Categories >> Software >> Operating Systems >> Data Structures
 
 


 

 
 Windows interview questions  Windows Interview Questions (339)
 Linux interview questions  Linux Interview Questions (451)
 Unix interview questions  Unix Interview Questions (455)
 Solaris interview questions  Solaris Interview Questions (781)
 RTOS interview questions  RTOS Interview Questions (43)
 Bulnex interview questions  Bulnex Interview Questions (4)
 Operating Systems General Concepts interview questions  Operating Systems General Concepts Interview Questions (261)
 Data Structures interview questions  Data Structures Interview Questions (67)
 Operating Systems AllOther interview questions  Operating Systems AllOther Interview Questions (48)
Question
What is binary tree?

 Question Submitted By :: Data-Structures
I also faced this Question!!     Answer Posted By  
 
Answer
# 1
A binary tree is a tree in which each node can have at most
two children. (i.e., left child and/or right child)
 
Is This Answer Correct ?    38 Yes 5 No
Arnoldindia
 
Answer
# 2
A binary tree is a tree which has every node has exactly two
links i.e left and right link
 
Is This Answer Correct ?    30 Yes 7 No
Wizard
 
 
 
Answer
# 3
A binary tree is a data structure in which the nodes
contains at most two links(i.e.,left child and/or right
child)
 
Is This Answer Correct ?    18 Yes 1 No
Ajay
 
Answer
# 4
A tree with at most two children for each node. 
Is This Answer Correct ?    13 Yes 1 No
Babita
 
Answer
# 5
A binary tree is a tree in which the degree of a node
maximum 2 is called a binary tree.
 
Is This Answer Correct ?    7 Yes 1 No
Veeru
 
Answer
# 6
A tree with at most two children for each node.

or

A binary tree either

* is empty (no nodes), or
* has a root node, a left binary tree, and a right
binary tree.
 
Is This Answer Correct ?    5 Yes 0 No
Chinnadurai.s
 
Answer
# 7
a binary tree is a tree in which each naode have 2 child
except leaf naode.
 
Is This Answer Correct ?    5 Yes 2 No
Ashutosh
 
Answer
# 8
A binary tree is a tree in which each node has either 0 or 2
child nodes.
 
Is This Answer Correct ?    5 Yes 4 No
Himani Madan
 
Answer
# 9
A binary tree is a tree in which all nodes are connected and
each node has indegree of maximum and outdegree of maximum 2
 
Is This Answer Correct ?    1 Yes 0 No
Saurabh
 
Answer
# 10
A Binary Tree is a finite set of elements called Node..... 
Is This Answer Correct ?    6 Yes 6 No
Naz
 

 
 
 
Other Data Structures Interview Questions
 
  Question Asked @ Answers
 
applications of linked lists and mostly used linked list?   3
create an singly linked lists and reverse the lists by interchanging the links and not the data? Microsoft 13
What is B+ tree? BMC 6
What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest? ABB 18
Which data structure is needed to convert infix notations to post fix notations? Fidelity 20
What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion? TCS 2
Write a Binary Search program Microsoft 7
Q # 1 : in which graph algorithm do we start finding vertices that should be first in the topological order and then apploy the fact that every vertex must come before its successors in the topolgical order.   3
Let the G be a graph with 100 vertices numbered 1 to 100 Two vertices i and j are adjecnt if | i-j| =8 or | i-j| =12. The Number of connected components in G is ?   4
The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered? Morgan-Stanley 11
ple.. briefly describe the purpose of having a base case and a recursive case in a recursive algorithm   2
A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?   12
 
For more Data Structures Interview Questions Click Here 
 
 
 
 
 


   
Copyright Policy  |  Terms of Service  |  Articles  |  Site Map  |  RSS Site Map  |  Contact Us
   
Copyright 2013  ALLInterview.com.  All Rights Reserved.

ALLInterview.com   ::  KalAajKal.com