# Data structure test - data structure exam

##### Your proficiency in data structures is judged by your performance in the online quiz. Reading books after books on data strucutre alone can not help you crack an interview. Practice with this set of 20 tricky questions on data structure to ensure that you choose the correct answer from very closely related options within the stipulated time. Whether you are an experienced professional or a fresher trying to make an entry into the corporate work, you will find this test extremely helpful.

Online Practice Test > Data structure test

##### Here are few sample Data-structure test/quiz questions

Which of the following statements hold true for binary trees?

The left subtree of a node contains only nodes with keys less than the node's key
The right subtree of a node contains only nodes with keys greater than the node's key.
Both a and b above
Noth left and right subtree nodes contains only nodes with keys less than the node's key

The time required in best case for search operation in binary tree is

O(n)
O(log n)
O(2n)
O(log 2n)

##### Can a stack be described as a pointer? Explain

Latest answer: A stack is represented as a pointer. The reason is that, it has a head pointer which points to the top of the stack..............

##### What is the recursion?

Latest answer: Recursion is an approach in which a function calls itself with an argument. Upon reaching a termination condition, the control returns to the calling function................

 Discussion Board Data Structure test - Data Structure Exam A ___________ tree is a tree where for each parent node, there is only one associated child nodebalanced binary treerooted complete binary treecomplete binary treedegenerate tree Data Structure test 05-11-2012 06:10 AM Data Structure test - Data Structure Exam What is the pecularity of red blac trees?In red-black trees, the root do not contain data.In red-black trees, the leaf nodes are not relevant and do not contain data.In red-black trees, the leaf nodes are relevant but do not contain data.Both a and c above Data Structure test 05-11-2012 06:10 AM Data Structure test - Data Structure Exam The time required in best case for search operation in binary tree isO(n)O(log n)O(2n)O(log 2n) Data Structure test 05-11-2012 06:09 AM Data Structure test - Data Structure Exam Which of the following statements hold true for binary trees?The left subtree of a node contains only nodes with keys less than the node's keyThe right subtree of a node contains only nodes with keys greater than the node's key.Both a and b aboveNoth left and right subtree nodes contains only nodes with keys less than the node's key Data Structure test 05-11-2012 06:08 AM More online test .NET testVB.NET testADO.NET testC#.NET testJava Mock TestEJB QuizJDBC QuizJava Applet QuizStruts QuizServlets QuizJava Web Services QuizJavascript Online Test Career 12-20-2011 04:42 AM