Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
write the non-recursive algorithm to traverse a tree in preorder the non- recursive algorithm for preorder traversal is as
implementation of queue using a singly linked list while implementing a queue as a single liked list a queue q consists of a list and two pointers
two-dimensional array is shown in memory in following two ways 1 row major representation to achieve this linear representation the first row
declaring a two dimensional array a two dimensional array is declared same to the way we declare a one-dimensional array except that we state the
define the term arrayan array is a way to reference a series of memory locations using the same name each memory location is represented by an array
depth-first traversal a depth-first traversal of a tree visit a node and then recursively visits the subtrees of that node likewise depth-first
threaded binary tree if a node in a binary tree is not having left or right child or it is a leaf node then that absence of child node is shown by
merge sortmerge sort is a sorting algorithm that uses the idea of split and conquers this algorithm splits the array into two halves sorts them
time complexity big o notationthe amount of time needed by an algorithm to run to its completion is referred as time complexity the asymptotic
b treeunlike a binary-tree every node of a b-tree may have a variable number of keys and children the keys are stored in non-decreasing order every
explain the representations of graphthe different ways of representing a graph isadjacency list representation this representation of graph having of
what are the different ways of representing a graphthe different ways of representing a graph isadjacency list representation this representation of
taking a suitable example explains how a general tree can be shown as a binary treeconversion of general trees to binary treesa general tree can be
how do you rotate a binary tree rotations in the treeif after inserting a node in a binary search tree the balancing factor height of left subtree
what are expression trees the leaves of an expression tree are operands like as constants or variable names and the other nodes have operators
what is a binary search tree bst a binary search tree b is a binary tree every node of which satisfies the three conditions1 the value of the
post-order traversalthis can be done both iteratively and recursively the iterative solution would need a change of the in-order traversal algorithm
bullmoral and ethical implicationsowill this be safe to have on the road will the computers on board be able to handle extreme
in-order traversal this process when executed iteratively also needs a stack and a boolean to prevent the implementation from traversing any
pre-order traversalthe method of doing a pre-order traversal iteratively then has the several stepssuppose that a stack is available to hold pointers
what are circular queues circular queue static queues have a very large drawback that once the queue is full even though we erase few elements
explain an efficient way of storing two symmetric matrices of the same order in memorya n-square matrix array is said to be symmetric if ajkakj for
explain an efficient way of storing a sparse matrix in memory a matrix in which number of zero entries are much higher than the number of non
relation between the time and space complexities of an algorithmthe examining of algorithm focuses on time complexity and space complexity as
how do you find the complexity of an algorithm complexity of an algorithm is the measure of analysis of algorithm analyzing an algorithm means