CSS interview questions part 18
CSS interview questions part 18
Take as many assements as you can to improve your validate your skill rating
Total Questions: 20
1. How many common operations are performed in a binary tree?
Correct Answer is : all of the mentioned
2. What is the traversal strategy used in the binary tree?
Correct Answer is : user agent declarations
3. How many types of insertion are performed in a binary tree?
Correct Answer is : transform-style
4. What operation does the following diagram depict?
Correct Answer is : @import
5. General ordered tree can be encoded into binary trees.
Correct Answer is : all
6. How many bits would a succinct binary tree occupy?
Correct Answer is : CSS Animations
7. The average depth of a binary tree is given as?
Correct Answer is : used value
8. How many orders of traversal can be applied to a binary tree?
Correct Answer is : computed value
9. If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?
Correct Answer is : cascaded value
10. Using what formula can a parent node be located in an array?
Correct Answer is : TRUE
11. The number of edges from the root to the node is called __________ of the tree.
Correct Answer is : Cascading Style Sheets
12. The number of edges from the node to the deepest leaf is called _________ of the tree.
Correct Answer is : Selector
13. What is a full binary tree?
Correct Answer is : Declaration
14. What is a complete binary tree?
Correct Answer is : all of the mentioned
15. What is the time complexity for finding the height of the binary tree?
Correct Answer is : id
16. Which of the following is not an advantage of trees?
Correct Answer is : Property-Name
17. In a full binary tree if number of internal nodes is I, then number of leaves L are?
Correct Answer is : class
