This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 2 years, 6 months ago.

  • Author
    Posts
  • #1427941 Reply
     EduGorilla 
    Keymaster
    Select Question Language :


    In a sequential representation of a binary tree in memory, let TREE be an array which is linear in nature. If any Node N occupies the position TREE[K] then its left child is stored in and it is right child is stored in-

    Options :-

    1. TREE [K + 1], TREE [K + 2]
    2. TREE [2 * K], TREE [2 * K + 1]
    3. TREE [2 * K + 1], TREE [2 * K + 2]
    4. TREE[K + 2], TREE [K + 1]
    Post your Training /Course Enquiry
    Are You looking institutes / coaching center for
    • IIT-JEE, NEET, CAT
    • Bank PO, SSC, Railways
    • Study Abroad
    Select your Training / Study category
Reply To: In a sequential representation of a binary tree in memory, let TREE be an array which is linear in n….
Your information:




Verify Yourself




Log in with your credentials

or    

Forgot your details?

Create Account