Question $1$: $(12$ marks$)$

For the Tree shown in Figure:

List the Leaves Nodes

The Children's of Node $19$

All the Nodes at Level $1$

Height of Node $10$

Depth of Node $43$

List the Interior Nodes

Siblings of Node $17$

Degree of Tree

Maximum number of nodes in a binary tree of height $4$

Maximum number of nodes at level $4$ in a binary tree

Construct Binary Tree after Insert Value $29$

Traverse the Binary Search Tree Using Depth First Search

$($DFS$)$

$\backslash$table$[[$Pre Order,,,,,,,,,$],[$Post Order,,,,,,,,,$]]$