Question 4  Write a Lisp functions for Binary Search Tree (of numbers).     (define insertTree (x tree)) returns a new tree with x inserted.     (define findInTree(x tree)) return true if x is in the tree.   Full explain this question and text typing work only

Does this article clarify tree traversals?

In what way do tree traversals function?

What is Computational Strategy for Array Implementation of Trees?

Design an interface for general trees—trees with unbounded degree. Make this interface as consistent as possible with BinaryTrees when the degree of a tree is no greater than 2

Define a Haskell instance of the Functor class for the following type of binary tree with data in nodes and leaves:data Tree a = Leaf a | Node a (Tree a) (Tree a)

Write a program to construct binary tree from a givenpreorder and postorder traversal sequence.using c language

Data Structures and Algorithms in C/C++ implement a variety of functions that operate on binary trees (the binary tree implementation from the book). You will be asked to test these functions on the following two trees (element data type is int):    implement a variety of functions that operate on binary trees (the binary tree implementation from the book). You will be asked to test these functions on the following two trees (element data type is int):  a)int count_leaves(BiTree *tree); Returns the number of leaf nodes in the tree.  b)  int count_non_leaves(BiTree *tree); Returns the number of non-leaf nodes in the tree.  c)  int get_height(BiTree *tree); Returns the height of the tree. d) void print_pre_order(BiTree *tree, void (*print)(const void *data)) Prints the elements of the tree to stdout using a pre-order traversal. The print parameter should contain the logic to print the data held in each node in the tree. e)  void print_in_order(BiTree *tree, void (*print)(const void…

What difficulties do you experience when attempting to define the idea of inorder traversal for ternary trees?