Free Printable Threaded Binary Tree

Worksheets

Threaded Binary Tree

Total questions: 10

Worksheet time: 5mins

Name

Class

Date

How are Threads typically implemented?

Using a separate thread array

By overloading pointer fields with flags

Storing thread IDs in nodes

Via external hash table

The inorder predecessor of a node in a right threaded binary tree can be found by:

following the left thread

Traversing the left subtree

following the right thread

checking the parent pointer

Which traversal in a threaded binary tree does NOT require a stack or recursion?

Level-Order Traversal

Preorder Traversal

Inorder Traversal

Postorder Traversal

In a threaded binary tree , a thread is a:

Pointer to the root node

Pointer to the child node

Pointer to the ancestor node

Pointer to the inorder successor/predecessor

What is the advantage of a threaded binary tree over a standard binary tree?

Faster insertion and deletion

No need for extra memory fro stack/recursion in traversal

Better balancing of tree

Reduced height of the tree

Which type of treaded binary tree contains thread only for NULL right pointer?

Fullu Threaded

Single Threaded(Left)

Double Threaded

Single Threaded(Right)

In a double threaded binary tree, threads are used to point to

Only left children

Only right children

Both inorder successor and predecessor

Parent nodes

What is the primary purpose of using threads in a threaded binary tree?

To simplify the insertion process

To increase the height of the tree

To facilitate faster traversal

To reduce the number of nodes

In a single threaded binary tree, which pointer is typically used for threading?

Left child pointer

Both child pointers

Right child pointer

Parent pointer

10.

Which traversal method can be performed without using additional memory in a threaded binary tree?