T13_BSTQ - Review Questions Tutorial#14 COMP152 Spring 2010...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1. Write a routine to print out the nodes of a binary tree in level-order . That is, list the root, then all nodes at depth 1, followed by nodes at depth 2, and so on. You must do this in linear time. 2. Two binary trees are similar if they are both empty or both non-empty and have the same left and right sub-trees. Write a function to decide whether two binary trees are similar. What is the running time of your function? 3. Since a binary tree with N nodes has N+1 NULL pointers, half of the space allocated in a binary search tree for pointer information is wasted. Suppose that if a node has a NULL left child, we make its left child link to its inorder predecessor, and if a node has a NULL right child, we make its right child link to its inorder successor. This is known as a “threaded tree” and the modified links are called “threads”. Normal Tree Thread Tree a. What do we need to do to distinguish threads from real children pointers? b.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 08/25/2010 for the course COMP COMP152 taught by Professor D.y.yeung during the Spring '10 term at HKUST.

Page1 / 2

T13_BSTQ - Review Questions Tutorial#14 COMP152 Spring 2010...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online