When traversing a binary tree, which diagram is pre-order? Data Structure

1806 students attemted this question.


No Explanation Available.

Share this question with friends

Similar Questions

  1. When traversing a binary tree, which diagram is post-order?

  2. In preorder traversal of a binary tree the second step is ____________

  3. Given a binary search tree, insert 27, 15, 63, 99, 70 and 85 (in this order) into the binary search tree. What is the post-order traversal?

  4. Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?

  5. Which of the following tree data structures is not a balanced binary tree?

  6. Given a sequence of number below: 50, 60, 40, 70, 45, 55, 30, 80, 65, 35, 25, 75, 85 When creating a binary search tree, what is the height of the tree?

  7. Which of the following is useful in traversing a given graph by breadth first search?

  8. Traversing each and every record exactly once is called_______

  9. B-tree of order n is a order-n multiway tree in which each non-root node contains __________

  10. The maximum number of nodes on level I of a binary tree is which of the following? (Root is Level 1)

  11. A Kind of tree where every node in a tree can have at most two children.

  12. B-tree and AVL tree have the same worst case time complexity for insertion and deletion.

  13. A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called

  14. A terminal node in a binary tree is called __________

  15. If node N is a terminal node in a binary tree then its ________

  16. Binary TREE

  17. A complete binary tree with 5 levels has how many nodes? (Root is Level 1)

  18. What is the best case height of a B-tree of order n and which has k keys?

  19. A tree sort is also known as__________ sort.

  20. TREE[1]=NULL indicates is _____________


Add Your Review

Your email address will not be published.

Subscribe to Newsletter!

Subscribe to get latest updates and information.