0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
Which of the following traversal is used for printing the keys of binary search tree in ascending order?
In order traversal is used.
What is traverse technique used in chain survey?
1. pre-order b-tree traversal. 2. in-order b-tree traversal. 3. post-order b-tree traversal
What is Linear and non linear list in data structure?
Linear : Traversal is linear .. ex: array,linked lists,stacks,queues NoN-linear: Traversal is not linear.. ex:trees,graphs imagine the situation of searching of particular element..in above scenarious..then u will understand easily.. Linear : Traversal is linear .. ex: array,linked lists,stacks,queues NoN-linear: Traversal is not linear.. ex:trees,graphs imagine the situation of searching of particular element..in above scenarious..then u will understand easily.. Linear : Traversal is linear .. ex: array,linked lists,stacks,queues NoN-linear: Traversal is not linear.. ex:trees,graphs imagine the situation of searching of particular element..in above scenarious..then u will understand easily..
Write the algorithm for in order traversal?
Inorder(p) { If p = nil return; Inorder(p.left) process(p.data) Inorder(p.right) }
Why is there no threading for post order traversal of a binary search tree?
You don't need it. Think about it, you can just use a stack (or a recursive function.)
Which of the following traversal is used for printing the keys of binary search tree in ascending order?
In order traversal is used.
What is traverse technique used in chain survey?
1. pre-order b-tree traversal. 2. in-order b-tree traversal. 3. post-order b-tree traversal
Is NAT and NAT traversal the same?
HiBoth are in same process but different. which mean NAT traversal techniques that establish and maintain IP connections traversing NAT.
What will be the root node of The preorder traversal is 5 3 66 30 77 70?
In preorder traversal, the root node is always visited first. The value of the root node in this case is 5.
Why does the property specify parallel lines?
the property has a parallel lines beacuse there traversal
What is Linear and non linear list in data structure?
Linear : Traversal is linear .. ex: array,linked lists,stacks,queues NoN-linear: Traversal is not linear.. ex:trees,graphs imagine the situation of searching of particular element..in above scenarious..then u will understand easily.. Linear : Traversal is linear .. ex: array,linked lists,stacks,queues NoN-linear: Traversal is not linear.. ex:trees,graphs imagine the situation of searching of particular element..in above scenarious..then u will understand easily.. Linear : Traversal is linear .. ex: array,linked lists,stacks,queues NoN-linear: Traversal is not linear.. ex:trees,graphs imagine the situation of searching of particular element..in above scenarious..then u will understand easily..
How do you know the length of the parallel lines if they are cut by a traversal?
The length of any line is infinite.
Same side exterior angles?
numbers on the out side of to parallel lines and on the same as traversal.
What are the three types of symmetry in science?
Rotational Symmetry, Traversal Symmetry, -Insert third type here-
What graph traversal algorithm uses a queue to keep track of vertices which need to be processed?
Breadth-first search
Write the algorithm for in order traversal?
Inorder(p) { If p = nil return; Inorder(p.left) process(p.data) Inorder(p.right) }
Why is there no threading for post order traversal of a binary search tree?
You don't need it. Think about it, you can just use a stack (or a recursive function.)
