CS301 Search MCQs Lectures 1-20

CS301 Updated 250+ MCqs · Lec 1 - 20 Spring 2022 · Quiz 1 and Quiz 2 · #Midterm Preparation · REMEMBER OWN PRAYER · Important NOTE:-

Like share and comment too ..ager koi mistake hogaye ho to sorry and comment main lazmi mention krdijiye ga takey main correction krlon file main …. And like zaroor krein is hamein or bhe apsab keyliye files makes krny ke himat milti hey

Q1. In which traversal method root node is visited at left first subtree?

2. In which traversal method root node is visited at first step? Preorder…..confirm

3. In which traversal method root node is visited at last step? Postorder……confirm

4. In level-order traversal for binary Search Tree _______ data structure is used. Queue….confirm
5. The statement the insertion operation in avl tree generally takes more time than insertion operation in simple binary search tree

Always correct….confirm

6. _________ is used for reference variables in C++ &….confirm

7. The first statement in the given code is called as: · Class BinarySearchTree; · Class BinaryNode{ · Friend class BinarySearchTree; · Forward declaration

Q8. Which of the following traversal method traverses the binary tree in sorted order?

9. The _____ symbol is used when we want to get the value of a variable using pointer. *…..confirm