Create a Binary Tree Manually in DSA C++ - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to declare a pointer to a new TreeNode.

DSA C++

TreeNode* root = new [1](10);

Drag options to blanks, or click blank then click option'

ATreeNode

BNode

CBinaryTree

DTree

Attempts:

3 left

💡 Hint

Common Mistakes

Using a wrong class name like Node or BinaryTree.

The class name for a tree node is TreeNode. We create a new node with value 10.

2fill in blank

medium

Complete the code to assign a new left child node with value 5 to root.

DSA C++

root->[1] = new TreeNode(5);

Drag options to blanks, or click blank then click option'

Aright

Bnode

Cchild

Dleft

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'right' instead of 'left'.

The left child pointer is named left. We assign a new node with value 5 to it.

3fill in blank

hard

Fix the error in the code to assign a right child node with value 15 to root.

DSA C++

root->[1] = new TreeNode(15);

Drag options to blanks, or click blank then click option'

Achild

Bnode

Cright

Dleft

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'left' instead of 'right'.

The right child pointer is named right. Assigning a new node to right is correct.

4fill in blank

hard

Fill both blanks to create a left child with value 3 and a right child with value 7 for the left child of root.

DSA C++

root->left->[1] = new TreeNode(3);
root->left->[2] = new TreeNode(7);

Drag options to blanks, or click blank then click option'

Aleft

Bright

Cchild

Dnode

Attempts:

3 left

💡 Hint

Common Mistakes

Swapping left and right pointers.

The left child of root gets a left child (value 3) and a right child (value 7). Use left and right pointers respectively.

5fill in blank

hard

Fill all three blanks to create a right child with value 20 for root, then add left and right children with values 17 and 25 to that node.

DSA C++

root->[1] = new TreeNode(20);
root->right->[2] = new TreeNode(17);
root->right->[3] = new TreeNode(25);

Drag options to blanks, or click blank then click option'

Aleft

Bright

Attempts:

3 left

💡 Hint

Common Mistakes

Mixing left and right pointers in the last two blanks.

First, assign the right child of root (blank 1) as right. Then assign its left child (blank 2) as left and right child (blank 3) as right.