In a full binary tree number of nodes is 63 then the height of the tree is :
Which of the following traversal outputs the data in sorted order in a BST?
The smallest element that can be found in time _______ in a binary max heap.
What will be the position of 5, when a max heap is constructed on the input elements 5, 70, 45, 7, 12, 15, 13, 65, 30, 25?
In a max-heap, element with the greatest key is always in the which node?
You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list?
What would be the asymptotic time complexity to find an element in the linked list?
A normal queue, if implemented using an array of size MAX_SIZE, gets full when
A queue follows __________
What is a full binary tree?