java program binary tree: Given the following binary tree, list all the leaf nodes of this binary tree:

JavaScript: Search the Tree A binary search tree is a data structure that consists of JavaScript objects called "nodes". A tree always has a root node which holds its own integer valueproperty and can have up to two child nodes (or leaf nodes), a left and right attribute. A leaf node holds a value attribute and, likewise, a left and rightattribute each potentially pointing to another node in the binary tree. Think of it as a Javascript object with potentially more sub-objects referenced by the left and right attributes (as seen in assignment 4). There are certain rules that apply to a binary tree: A node's left leaf node has a value that is <= than to its own value A node's right leaf node has a value that is => its own value In other words: let node = {value: <some number>left: <a node object with value attribute <= this object's value>right: <a node object with value attribute >= this object's value>} If you need a visual aid, below is an example of…

the Java code that removes the top BinaryTree of a tree andreturns the root of the resulting tree

Q5_2\ Draw the binary search tree that would result from the insertion of the following integer keys: 14   58   18    10    99   52     33    69     47     17.