Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Q. Write down a non recursive algorithm to traverse a binary tree in order.
Ans:
Non - recursive algorithm to traverse a binary tree in inorder is as follows:-
Initially in the beginning push NULL onto STACK and then set PTR = ROOT. Then repeat the steps written below until NULL is popped from STACK.
i. Continue down the left -most path rooted at PTR, pushing each node N onto STACK and stopping when a node N with no left child is pushed onto
STACK.
ii. [Backtracking.] Pop and process the nodes on
STACK. If the NULL is popped then Exit. If a node N
Having a right child R(N) is processed, set PTR = R(N) (by assigning PTR = RIGHT[PTR] and return to the Step(a)).
How divide and conquer technique can be applied to binary trees? As the binary tree definition itself separates a binary tree into two smaller structures of the similar type,
Q. Give the adjacency matrix for the graph drawn below: Ans: Adjacency matrix for the graph given to us
Chaining In this method, instead of hashing function value as location we use it as an index into an array of pointers. Every pointer access a chain that holds the element havi
Draw trace table and determine output from the subsequent flowchart using below data: X = 5, -3, 0, -3, 7, 0, 6, -11, -7, 12
Merging 4 sorted files having 50, 10, 25 and 15 records will take time O (100)
Q. Write down an algorithm to test whether a Binary Tree is a Binary Search Tree. A n s . The algorithm to check whether a Binary tree is as Binary Search
Example: (Double left rotation while a new node is added into the AVL tree (RL rotation)) Figure: Double left rotation when a new node is inserted into the AVL tree A
(a) Suppose that t is a binary tree of integers (that is, an object of type BinTree of Int.) in the state shown in Figure 3. Give the vectors returned by each of the f
Program of sun series
Typical programming languages such as Pascal, C or Java give primitive data kinds such as integers, boolean, reals values and strings. They give these to be organised into arrays,
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd