Which of the following statement is correct?
A threaded Binary tree is a binary tree in which every node that does not
have a left child has a THREAD (in actual sense, a link) to its INORDER
successor.
A threaded Binary tree is a binary tree in which every node that does not
have a right child has a THREAD (in actual sense, a link) to its PREORDER
successor.
A threaded Binary tree is a binary tree in which every node that does not
have a left child has a THREAD (in actual sense, a link) to its INORDER
successor.
A threaded Binary tree is a binary tree in which every node that does not
have a right child has a THREAD (in actual sense, a link) to its POSTORDER
predecessor.
f one pointer of the nodes in a binary tree is NULL then it will be a/an
Inner node
Leaf node
External node
Root node
By using __________we avoid the recursive method of traversing a Tree,
which makes use of stacks and consumes a lot of memory and time.
Binary tree only
Heap data structure
Huffman encoding
A binary tree of N external nodes has N internal node
*A Binary tree of N internal nodes has N+1 external node*
A Binary tree of N external nodes has N+1 internal node
A Binary tree of N internal has N-1 external node
Which of the following statement concerning heaps is NOT true?
Select correct option:
A heap can be stored in a binary search tree.
A heap can be stored in an array.
A heap can be used to implement a priority queue.
A heap can be used to sort data.
Which of the following statement is true about dummy node of threaded
binary tree?
The left pointer of dummy node points to the itself while the right pointer
points to the root of tree.
The left pointer of dummy node points to the root node of the tree while
the right pointer points itself i.e. to dummy node.
The left pointer of dummy node points to the root node of the tree while
the right pointer is always NULL.
The right pointer of dummy node points to the itself while the left pointer
is always NULL.
Threaded binary tree
consider a binary tree, represented by the following array:
10,7,9,5,2,1,6,3,4 This is a ________.
Min heap
Max heap (Not Sure)
Threaded binary tree
Binary Search tree
--
...:::Group Rules:::...
http://groups.google.com.pk/group/vu-pink/web/group-rules
^^^^^^
You received this message because you are subscribed to the Google
Groups "vu pink" group.
To post to this group, send email to vu-pink@googlegroups.com
To unsubscribe from this group, send email to
vu-pink+unsubscribe@googlegroups.com
For more options, visit this group at
http://groups.google.com.pk/group/vu-pink?hl=en
No comments:
Post a Comment