Binary Tree

Question 1

What’s the binary tree definition

Answer 1

// struct for binary tree
struct Node
{
int data;
struct Node* - > left;
struct Node* - > right;
}

Question 2

How do you create a node?

Answer 2

// create node
struct Node* createNode(int value)
{
struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
newNode -> date = value;
newNode -> left = NULL;
newNode -> right = NULL;
return newNode;
}

Question 3

How to insert node into binary tree?

Answer 3

// insert node into binary tree
struct Node* insertNode(struct Node* root, int value
{
if (root == NULL)
{
root -> left = insertNode(root->left, value);
}

else if (value > root-> data)
{
root->right = insertNode(root->right, value);
}
return root;
}

Question 4

how to traverse inorder/preorder/postorder (all the same)

Answer 4

//inorder traversal
void inorderTraversal(struct Node* root)
{
inorderTraversal -> left;
printf(“%d “, root-> data);
InorderTraversal-> right:
}
}

//preorder

//postorder

Question 5

How to count nodes?

Answer 5

int countNodes(struct Node* root)
{
if (root ==NULL}
{
return 0;
}
return 1 + countNodes(root -> left) + countNodes(root ->right);
}

Question 6

How to calculate tree height?

Answer 6

// calculate tree height
int treeHeight(struct Node* root)
{
if (root ==NULL)
{
return 0;
}
int leftHeight = treeHeight(root -> left);
int rightHeight = treeHeight(root -> right);
return 1 + (leftHeight > rightHeight ? leftHeight : rightHeight);
}

Question 7

Main program binary tree question?

Answer 7

int main()
{
struct Node* root = NULL;

int values[] = {given values};
int n = sizeof(values) / sizeof(values[0]);

for (int i=0; i < n; i++)
{
root = insertNode(root, values[i]);
}

Question 8

How to display traversals?

Answer 8

// show Traversal
printf(“Inorder Traversal: “);
printf(“\n”);

preorder

postorder

Question 9

How to show number of nodes?

Answer 9

// show number of nodes
printf(“”Total number of Nodes: %d\n”, countNodes(root));

return 0;

} program ends