Using this style of coding binary tree what will be the method that count the non leaves nodes

And another method that will count the left or right nodes in the tree

Binary Search Tree (Complete Program) TreeNode.java publie class TreeNode publie int key: public TreeNode left, right; publie TreeNode left-right-null; publie TreeNode (int el) this(el,null,null); public TreeNode(int el, TreeNode It, TreeNode rt) key - el; left-lt; right rt; TreeList.java publie elass TreeList public TreeNode root; publie TreeListO root = null