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 (458)
 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
 
Stack can be described as a pointer. Explain. Wipro 5
wt is a datastructure CybAge 8
Write the programs for Linked List (Insertion and Deletion) operations Persistent 9
No. of possible ordered trees with n nodes ? Please give formula (if any).   1
What does abstract data type means? TCS 23
why do tree always takes o(log n) time? TCS 1
Tell me real world example of polymorphism and encapsulation . CybAge 7
How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3? iGate 28
Evaluate the following prefix expression " ++ 26 + - 1324" Patni 22
1) Program A and B are analyzed and found to have worst- case running times no greater than 150nlog2n and n2 respectively.Answer the folloWing questions if possible.. i) which program has the better guarantee on the running time,for larger values of n(n>10000) ? ii) which program has the better guarantee on the running time,for small values of n(n<100) ? iii) which program will run faster on average for n =1000 2) wRite a program to compute the number of collisions required in a long random sequence of insertions using linear probing ,quadratic probing and double hashing 3) what is the optimal way to compute A1 A2 A3 A4 A5 A6 where the dimensions of the matrices are A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30 A6 : 30 X 15 KPIT 3
How can one find a cycle in the linked list? IF found how to recognize the cycle and delete that cycle? Citrix 12
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
 
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