Give an inductive definition of the function nodecount(t) which computes the number of internal nodes in the binary tree t, where binary trees are defined inductively by the BNF equation t ::= * | N(t, t) Use this function to verify that nodecount (N (N(*, N(*, *)), N(*, *) ))= 4

Consider the following function about binary trees: int dog( TreeNodeTypePointer p) { if (p==NULL) return 0; else if (p->left == NULL && p->right == NULL) return 0; else if (p->left != NULL && p->right != NULL) return dog(p->left) + dog(p->right); else return 1 + dog (p->left) + dog(p->right); } What does this function do? A. Computes the number of leaves B. Computes the number of internal nodes C. Computes the number of nodes with 2 children nodes D. Computes the number of nodes with 1 child node

For a single binary tree whose in-order traversal is HDIAJTURP M S and whose post-order traversal is HIDJUTA PS M R a. Draw the binary tree.

Construct a binary tree from the given preorder and inorder traversals. Preorder: GBQACK EPDERH Inorder QBKCFAGPEDHR

Question 6 In a binary search tree, if a node has a value n, all of the values in its left subtree: O are less than n O are always a queue O are negative O have no relationship to n

What is the maximum number of nodes in a balanced binary tree of height 5 given that a tree with only one node has height 1?

Write the binary tree representation for the Binary Search for also 17 elements and give the worst-case

A Binary Search Tree (BST) can be used to efficiently implement a sorted set. It stores uniquevalues and offers an efficient membership method (contains).A binary search tree (BST) is a binary tree with the additional binary search tree property.The binary search tree property states that for every node n in the tree1. n.data is greater than the data value of all nodes in the sub-tree rooted with n.left.2. n.data is less than the data value of all nodes in the sub-tree rooted with n.right.As we are implementing a set, all data (strings) in the tree will be unique. Every node in the treewill have its own distinct string. Strings will be compared using the canonical way (as defined bythe compareTo() method in the String class).For example, the binary tree on the left (below) IS a binary search tree and the one on the rightis NOT.You will implement several methods in the BinaryTree and BST classes. The BST class mustextend the BinaryTree class. Methods that you must complete (implement or…