Can a tree stored in an array using either one of inorder or...

MCQ

Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?

yes just traverse through the array and form the tree

No we need one more traversal to form a tree

No in case of sparse trees

None of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Consider the pseudo code below.
Does the below code can check if a binary search tree is an AVL tree?

int avl(binarysearchtree root):
     if(not root)
       return 0
     left_tree_height = avl(left_of_root)
 
     if(left_tree_height== -1) 
       return left_tree_height
 
     right_tree_height= avl(right_of_root)
 
     if(right_tree_height==-1)
       return right_tree_height

yes

May be

Can't say

Discussion

MCQ

If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then

we'll get a different spanning tree.

we'll get the same spanning tree.

spanning will have less edges.

spanning will not cover all vertices.

Discussion

MCQ

When we have red-black trees and AVL trees that can perform most of operations in logarithmic times, then what is the need for splay trees?

no there is no special usage

In real time it is estimated that 80% access is only to 20% data, hence most used ones must be easily available

redblack and avl are not upto mark

they are just another type of self balancing binary search trees

Discussion

MCQ

Consider a sequence of numbers to have repetitions, how a cartesian tree can be constructed in such situations without violating any rules?

use any tie-breaking rule between repeated elements

cartesian tree is impossible when repetitions are present

construct a max heap in such cases

construct a min heap in such cases

Discussion

MCQ

Re-balancing of AVL tree costs

?(1)

?(log n)

?(n)

?(n2)

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics